default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 57
Volume 57, 1992
- Michael C. Ferris, Olvi L. Mangasarian:
Minimum principle sufficiency. 1-14 - Jonathan M. Borwein
, Adrian S. Lewis:
Partially finite convex programming, Part I: Quasi relative interiors and duality theory. 15-48 - Jonathan M. Borwein, Adrian S. Lewis:
Partially finite convex programming, Part II: Explicit lattice models. 49-83 - Vaithilingam Jeyakumar, Henry Wolkowicz:
Generalizations of Slater's constraint qualification for infinite convex programs. 85-101 - James V. Burke, R. A. Poliquin:
Optimality conditions for non-finite valued convex composite functions. 103-120 - Ilan Adler, Peter A. Beling:
Polynomial algorithms for LP over a subring of the algebraic integers with applications to LP with circulant matrices. 121-143 - Khaled S. Al-Sultan, Katta G. Murty:
Exterior point algorithms for nearest points and convex quadratic programs. 145-161 - David S. Atkinson, Pravin M. Vaidya:
A scaling technique for finding the weighted analytic center of a polytope. 163-192 - Ding-Zhu Du, Yanjun Zhang:
On better heuristics for Steiner minimum trees. 193-202 - Peter Gritzmann, Victor Klee:
Deciding uniqueness in norm maximization. 203-214 - Anil P. Kamath, Narendra Karmarkar, K. G. Ramakrishnan, Mauricio G. C. Resende:
A continuous approach to inductive inference. 215-238 - Jie Sun, Liqun Qi:
An interior point algorithm of O(Quadrat Root(m) absolute (ln epsilon)) iterations for C-convex programming. 239-257 - Craig A. Tovey:
A polynomial-time algorithm for computing the yolk in fixed dimension. 259-277 - Stephen A. Vavasis:
Approximation algorithms for indefinite quadratic programming. 279-311 - Grzegorz W. Wasilkowski:
On average complexity of global optimization problems. 313-324 - Yinyu Ye:
On the finite convergence of interior-point algorithms for linear programming. 325-335 - Panos M. Pardalos, Stephen A. Vavasis:
Open questions in complexity theory for numerical optimization. 337-339 - John J. Forrest, Donald Goldfarb:
Steepest-edge simplex algorithms for linear programming. 341-374 - Robert G. Jeroslow, R. Kipp Martin, Ronald L. Rardin, Jinchang Wang:
Gainfree Leontief substitution flow problems. 375-414 - Bart De Moor, Lieven Vandenberghe, Joos Vandewalle:
The generalized linear complementarity problem and an algorithm to find all its solutions. 415-426 - Sjur Didrik Flåm:
On finite convergence and constraint identification of subgradient projection methods. 427-437 - Wallace C. Pye:
Almost P0-matrices and the class Q. 439-444 - Bruno Betrò, Fabio Schoen:
Optimal and sub-optimal stopping rules for the Multistart algorithm in global optimization. 445-458 - Mark E. Hartmann, Michael H. Schneider:
An analogue of Hoffman's circulation conditions for max-balanced flows. 459-476
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-05-14 21:55 CEST 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:
