default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 50
Volume 50, 1991
- Jean Charles Gilbert
:
Maintaining the positive definiteness of the matrices in reduced secant methods for equality constrained optimization. 1-28 - Ilan Adler, Renato D. C. Monteiro:
Limiting behavior of the affine scaling continuous trajectories for linear programming problems. 29-51 - A. B. Gamble, Andrew R. Conn, William R. Pulleyblank:
A network penalty method. 53-73 - Sehun Kim, Hyunsil Ahn:
Convergence of a generalized subgradient method for nondifferentiable convex optimization. 75-80 - Sanjay Mehrotra, Jie Sun:
On computing the center of a convex quadratically constrained set. 81-89 - Chang C. Y. Dorea:
Effort associated with a class of random optimization methods. 91-98 - Dinh The Luc:
Contingent derivatives of set-valued maps and applications to vector optimization. 99-111 - Ulrich Derigs, Achim Metz:
Solving (large scale) matching problems combinatorially. 113-121 - Arie Tamir:
On the core of network synthesis games. 123-135 - Andreas Griewank:
The global convergence of partitioned BFGS on problems with convex decompositions and Lipschitzian gradients. 141-175 - Andrew R. Conn, Nicholas I. M. Gould, Philippe L. Toint:
Convergence of quasi-Newton matrices generated by the symmetric rank one update. 177-195 - Werner Römisch, Rüdiger Schultz:
Distribution sensitivity in stochastic programming. 197-226 - Jerzy A. Filar, Todd A. Schultz, Frank Thuijsman, O. J. Vrieze:
Nonlinear programming and stationary equilibria in stochastic games. 227-237 - Yinyu Ye:
An O(n3L) potential reduction algorithm for linear programming. 239-258 - Reiner Horst, Nguyen V. Thoai, Harold P. Benson:
Concave minimization via conical partitions and polyhedral outer approximation. 259-274 - Andrew V. Goldberg, Michael D. Grigoriadis, Robert Endre Tarjan:
Use of dynamic trees in a network simplex algorithm for the maximum flow problem. 277-290 - D. A. Bayer, Jeffrey C. Lagarias:
Karmarkar's linear programming algorithm and Newton's method. 291-330 - Masakazu Kojima, Shinji Mizuno, Akiko Yoshise:
An O(square root(n) * L) iteration potential reduction algorithm for linear complementarity problems. 331-342 - Arnold Lent, Yair Censor:
The primal-dual algorithm as a constraint-set-manipulation device. 343-357 - Michael C. Ferris:
Finite termination of the proximal point algorithm. 359-366 - Anton Dekkers, Emile H. L. Aarts:
Global optimization and simulated annealing. 367-393 - Itamar Pitowsky:
Correlation polytopes: Their geometry and complexity. 395-414
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-12 21:47 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:
