default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 158
Volume 158, Numbers 1-2, July 2016
- Arnold Neumaier
:
OSGA: a fast subgradient algorithm with optimal complexity. 1-21 - Florian Jarre, Philippe L. Toint:
Simple examples for the failure of Newton's method with line search for strictly convex minimization. 23-34 - Helmut Gfrerer, Diethard Klatte:
Lipschitz and Hölder stability of optimization problems and generalized equations. 35-75 - Dominik Dorsch, Walter Gómez, Vladimir Shikhman:
Sufficient optimality conditions hold for almost all nonlinear semidefinite programs. 77-97 - Stavros G. Kolliopoulos, Yannis Moysoglou:
Integrality gaps for strengthened linear relaxations of capacitated facility location. 99-141 - Chanaka Edirisinghe, Jaehwan Jeong:
An efficient global algorithm for a class of indefinite separable quadratic programs. 143-173 - Pelin Damci-Kurt, Simge Küçükyavuz, Deepak Rajan, Alper Atamtürk:
A polyhedral study of production ramping. 175-205 - Maurice Cheung, Adam N. Elmachtoub, Retsef Levi, David B. Shmoys:
The submodular joint replenishment problem. 207-233 - Alain Billionnet, Sourour Elloumi, Amélie Lambert:
Exact quadratic convex reformulations of mixed-integer quadratically constrained problems. 235-266 - María J. Cánovas, Abderrahim Hantoute, Juan Parra, F. Javier Toledo-Moreo:
Calmness modulus of fully perturbed linear programs. 267-290 - Ruiwei Jiang, Yongpei Guan:
Data-driven chance constrained stochastic program. 291-327 - Dan Garber, Elad Hazan:
Sublinear time algorithms for approximate semidefinite programming. 329-361 - Elad Hazan, Tomer Koren:
A linear-time algorithm for trust region problems. 363-381 - Andreas Griewank, Andrea Walther, Sabrina Fiege, Torsten Bosse:
On Lipschitz optimization based on gray-box piecewise linearization. 383-415 - Hamza Fawzi, Pablo A. Parrilo:
Self-scaled bounds for atomic cone ranks: applications to nonnegative rank and cp-rank. 417-465 - Ya-Feng Liu, Shiqian Ma, Yu-Hong Dai, Shuzhong Zhang:
A smoothing SQP framework for a class of composite Lq minimization over polyhedron. 467-500 - Adrian S. Lewis, Stephen J. Wright:
A proximal method for composite minimization. 501-546 - Michel Baes, Timm Oertel, Robert Weismantel:
Duality for mixed-integer convex minimization. 547-564 - Satoru Iwata, Naoyuki Kamiyama, Naoki Katoh, Shuji Kijima, Yoshio Okamoto:
Extended formulations for sparsity matroids. 565-574 - Laurent Condat:
Fast projection onto the simplex and the l1 ball. 575-585
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.
last updated on 2025-12-09 23:26 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
