default search action
Mathematical Programming, Volume 164
Volume 164, Numbers 1-2, July 2017
- Amir Beck, Shimrit Shtern:
Linearly convergent away-step conditional gradient for non-strongly convex functions. 1-27 - Silvia Vogel:
Random approximations in multiobjective optimization. 29-53 - Francisco Facchinei, Lorenzo Lampariello, Gesualdo Scutari:
Feasible methods for nonconvex nonsmooth problems with applications in green communications. 55-90 - Luca Consolini, Marco Locatelli:
On the complexity of quadratic programming with two quadratic constraints. 91-128 - Maurice Queyranne, Laurence A. Wolsey:
Tight MIP formulations for bounded up/down times and interval-dependent start-ups. 129-155 - Paolo Nobili, Antonio Sassano:
An 𝒪 (m log n) algorithm for the weighted stable set problem in claw-free graphs with α(G) ≤ 3. 157-165 - Miguel A. Goberna, Nader Kanzi:
Optimality conditions in convex multiobjective SIP. 167-191 - Chanaka Edirisinghe, Jaehwan Jeong:
Tight bounds on indefinite separable singly-constrained quadratic programs in linear-time. 193-227 - Anne Greenbaum, Adrian S. Lewis, Michael L. Overton:
Variational analysis of the Crouzeix ratio. 229-243 - Yohann Benchetrit:
Integer round-up property for the chromatic number of some h-perfect graphs. 245-262 - Heinz H. Bauschke, Walaa M. Moursi:
On the Douglas-Rachford algorithm. 263-284 - James Cussens, David Haws, Milan Studený:
Polyhedral aspects of score equivalence in Bayesian network structure learning. 285-324 - Friedrich Eisenbrand, Santosh S. Vempala:
Geometric random edge. 325-339 - Chao Ding, Hou-Duo Qi:
Convex optimization learning of faithful Euclidean distance representations in nonlinear dimensionality reduction. 341-381 - Sina Modaresi, Juan Pablo Vielma:
Convex hull of two quadratic or a conic quadratic and a quadratic inequality. 383-409
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.