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
- 2013
- Xiaojun Chen, Shuhuang Xiang:
Newton iterations in implicit time-stepping scheme for differential linear complementarity systems. Math. Program. 138(1-2): 579-606 (2013) - Gemayqzel Bouza Allende, Georg Still:
Solving bilevel programs with the KKT-approach. Math. Program. 138(1-2): 309-332 (2013) - Immanuel M. Bomze, Gabriele Eichfelder:
Copositivity detection by difference-of-convex decomposition and ω-subdivision. Math. Program. 138(1-2): 365-400 (2013) - Yu-Hong Dai:
A perfect example for the BFGS method. Math. Program. 138(1-2): 501-530 (2013) - Stephan Dempe, Alain B. Zemkoho:
The bilevel programming problem: reformulations, constraint qualifications and optimality conditions. Math. Program. 138(1-2): 447-473 (2013) - Darinka Dentcheva, Maria Gabriela Martinez:
Regularization methods for optimization problems with probabilistic constraints. Math. Program. 138(1-2): 223-251 (2013) - Bernard Fortz, Martine Labbé, François V. Louveaux, Michael Poss:
Stochastic binary problems with simple penalties for capacity constraints violations. Math. Program. 138(1-2): 199-221 (2013) - Peter W. Glynn, Gerd Infanger:
Simulation-based confidence bounds for two-stage stochastic programs. Math. Program. 138(1-2): 15-42 (2013) - Clóvis C. Gonzaga, Elizabeth W. Karas:
Fine tuning Nesterov's steepest descent algorithm for differentiable convex programming. Math. Program. 138(1-2): 141-166 (2013) - Vincent Guigues, Claudia A. Sagastizábal:
Risk-averse feasible policies for large-scale multistage stochastic linear programs. Math. Program. 138(1-2): 167-198 (2013) - David Hartvigsen, Yanjun Li:
Polyhedron of triangle-free simple 2-matchings in subcubic graphs. Math. Program. 138(1-2): 43-82 (2013) - J. William Helton, Igor Klep, Scott A. McCullough:
The matricial relaxation of a linear matrix inequality. Math. Program. 138(1-2): 401-445 (2013) - Masakazu Kojima, Makoto Yamashita:
Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization. Math. Program. 138(1-2): 333-364 (2013) - Nan Kong, Andrew J. Schaefer, Shabbir Ahmed:
Totally unimodular stochastic programs. Math. Program. 138(1-2): 1-13 (2013) - Guanghui Lan, Renato D. C. Monteiro:
Iteration-complexity of first-order penalty methods for convex programming. Math. Program. 138(1-2): 115-139 (2013) - M. J. D. Powell:
Beyond symmetric Broyden for updating quadratic models in minimization without derivatives. Math. Program. 138(1-2): 475-500 (2013) - Burhaneddin Sandikçi, Nan Kong, Andrew J. Schaefer:
A hierarchy of bounds for stochastic mixed-integer programs. Math. Program. 138(1-2): 253-272 (2013) - Anton Schiela:
An interior point method in function space for the efficient solution of state constrained optimal control problems. Math. Program. 138(1-2): 83-114 (2013) - Sangho Shim, Ellis L. Johnson:
Cyclic group blocking polyhedra. Math. Program. 138(1-2): 273-307 (2013) - Mohit Tawarmalani, Jean-Philippe P. Richard, Chuanhui Xiong:
Explicit convex and concave envelopes through polyhedral subdivisions. Math. Program. 138(1-2): 531-577 (2013)
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 2025-01-18 16:37 CET 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