Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 20 matches
- 2023
- Andrew Butler, Roy H. Kwon:
Gradient boosting for convex cone predict and optimize problems. Oper. Res. Lett. 51(1): 79-83 (2023) - 2022
- Thai Doan Chuong:
Second-order cone programming relaxations for a class of multiobjective convex polynomial problems. Ann. Oper. Res. 311(2): 1017-1033 (2022) - Amir Ahmadi-Javid, Pooya Hoseinpour:
Convexification of Queueing Formulas by Mixed-Integer Second-Order Cone Programming: An Application to a Discrete Location Problem with Congestion. INFORMS J. Comput. 34(5): 2621-2633 (2022) - Andrew Butler, Roy H. Kwon:
Gradient boosting for convex cone predict and optimize problems. CoRR abs/2204.06895 (2022) - 2020
- Alireza Nazemi, Atiye Sabeghi:
A new neural network framework for solving convex second-order cone constrained variational inequality problems with an application in multi-finger robot hands. J. Exp. Theor. Artif. Intell. 32(2): 181-203 (2020) - 2019
- Alireza Nazemi:
A new collaborate neuro-dynamic framework for solving convex second order cone programming problems with an application in multi-fingered robotic hands. Appl. Intell. 49(10): 3512-3523 (2019) - Alireza Nazemi, Atiye Sabeghi:
A novel gradient-based neural network for solving convex second-order cone constrained variational inequality problems. J. Comput. Appl. Math. 347: 343-356 (2019) - Zhe Hong, Guang-Ri Piao, Do Sang Kim:
On approximate solutions of nondifferentiable vector optimization problems with cone-convex objectives. Optim. Lett. 13(4): 891-906 (2019) - 2018
- Ankur Sinha, Pekka Malo, Markku Kallio:
Convex preference cone-based approach for many objective optimization problems. Comput. Oper. Res. 95: 1-11 (2018) - 2017
- Amir Ahmadi-Javid, Pooya Hoseinpour:
Convexification of Queueing Formulas by Mixed-Integer Second-Order Cone Programming: An Application to a Discrete Location Problem with Congestion. CoRR abs/1710.05794 (2017) - 2015
- Carmo P. Brás, Masao Fukushima, Alfredo N. Iusem, Joaquim João Júdice:
On the Quadratic Eigenvalue Complementarity Problem over a general convex cone. Appl. Math. Comput. 271: 594-608 (2015) - Xinhe Miao, Jein-Shan Chen:
Characterizations of solution sets of cone-constrained convex programming problems. Optim. Lett. 9(7): 1433-1445 (2015) - 2012
- Zhe Chen:
Characterizations of Asymptotic Cone of the Solution Set of a Composite Convex Optimization Problem. J. Appl. Math. 2012: 617485:1-617485:7 (2012) - Hongchun Sun, Yiju Wang:
Global Error Bound Estimation for the Generalized Nonlinear Complementarity Problem over a Closed Convex Cone. J. Appl. Math. 2012: 245458:1-245458:11 (2012) - 2011
- Stephen Becker, Emmanuel J. Candès, Michael C. Grant:
Templates for convex cone problems with applications to sparse signal recovery. Math. Program. Comput. 3(3): 165-218 (2011) - Yongdo Lim:
Maximum-Volume Symmetric Gauge Ball Problem on the Convex Cone of Positive Definite Matrices and Convexity of Optimal Sets. SIAM J. Optim. 21(4): 1275-1288 (2011) - 2010
- Ravi P. Agarwal, Izhar Ahmad, Anurag Jayswal:
Higher order symmetric duality in nondifferentiable multi-objective programming problems involving generalized cone convex functions. Math. Comput. Model. 52(9-10): 1644-1650 (2010) - 2005
- Mohammad R. Oskoorouchi, Jean-Louis Goffin:
An Interior Point Cutting Plane Method for the Convex Feasibility Problem with Second-Order Cone Inequalities. Math. Oper. Res. 30(1): 127-149 (2005) - Vladimir G. Boltyanski:
Separation of convex cones and extremal problems. Optim. Methods Softw. 20(2-3): 189-195 (2005) - 1993
- Andrzej Cegielski:
Projection onto an acute cone and convex feasibility problem. System Modelling and Optimization 1993: 187-194
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-05-10 05:37 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint