default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 160
Volume 160, Numbers 1-2, November 2016
- Xiaoqin Hua
, Nobuo Yamashita:
Block coordinate proximal gradient methods with variable Bregman functions for nonsmooth separable optimization. 1-32 - Christian Kanzow:
On the multiplier-penalty-approach for quasi-variational inequalities. 33-63 - Cristian Dobre, Mirjam Dür, Leonhard Frerick, Frank Vallentin:
A copositive formulation for the stability number of infinite graphs. 65-83 - Egon Balas, Tamás Kis:
On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts. 85-114 - Maria Soledad Aronna, J. Frédéric Bonnans, B. S. Goh:
Second order analysis of control-affine problems with scalar state constraint. 115-147 - Hamza Fawzi, James Saunderson, Pablo A. Parrilo:
Sparse sums of squares on finite abelian groups and improved semidefinite lifts. 149-191 - Sarah M. Moffat, Walaa M. Moursi, Xianfu Wang:
Nearly convex sets: fine properties and domains or ranges of subdifferentials of convex functions. 193-223 - Viswanath Nagarajan, Cong Shi:
Approximation algorithms for inventory problems with submodular or routing costs. 225-244 - Sanjeeb Dash, Oktay Günlük, Diego A. Morán R.:
On the polyhedrality of cross and quadrilateral closures. 245-270 - Michael Hintermüller, Thomas M. Surowiec:
A bundle-free implicit programming approach for a class of elliptic MPECs in function space. 271-305 - Clóvis C. Gonzaga:
On the worst case performance of the steepest descent algorithm for quadratic functions. 307-320 - Yoel Drori, Marc Teboulle:
An optimal variant of Kelley's cutting-plane method. 321-351 - Michal Cervinka, Christian Kanzow, Alexandra Schwartz:
Constraint qualifications and optimality conditions for optimization problems with cardinality constraints. 353-377 - Andreas Emil Feldmann, Jochen Könemann, Neil Olver, Laura Sanità:
On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree. 379-406 - Gábor Braun, Samuel Fiorini, Sebastian Pokutta:
Average case polyhedral complexity of the maximum stable set problem. 407-431 - Afonso S. Bandeira, Christopher Kennedy, Amit Singer:
Approximating the little Grothendieck problem over the orthogonal and unitary groups. 433-475 - Ilan Adler, Richard W. Cottle, Jong-Shi Pang:
Some LCPs solvable in strongly polynomial time with Lemke's algorithm. 477-493 - Katya Scheinberg, Xiaocheng Tang:
Practical inexact proximal quasi-Newton method with global complexity analysis. 495-529 - Frans J. C. T. de Ruiter, Ruud Brekelmans, Dick den Hertog:
The impact of the existence of multiple adjustable robust solutions. 531-545 - Roberto Andreani, José Mario Martínez, Lúcio Tunes Santos:
Newton's method may fail to recognize proximity to optimal points in constrained optimization. 547-555
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 2024-11-21 20:32 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:
