default search action
SIAM Journal on Optimization, Volume 2
Volume 2, Number 1, 1992
- Stefan Schäffler:
Classification of Critical Stationary Points in Unconstrained Optimization. 1-6 - Yinyu Ye:
A Potential Reduction Algorithm Allowing Column Generation. 7-20 - Jean Charles Gilbert
, Jorge Nocedal:
Global Convergence Properties of Conjugate Gradient Methods for Optimization. 21-42 - Zhi-Quan Luo, Paul Tseng:
Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem. 43-54 - Dick den Hertog, Cornelis Roos, Tamás Terlaky:
A Large-Step Analytic Center Method for a Class of Smooth Convex Programming Problems. 55-70 - Dick den Hertog, Cornelis Roos, Jean-Philippe Vial:
A Complexity Reduction for the Long-Step Path-Following Algorithm for Linear Programming. 71-87 - Michael L. Overton:
Large-Scale Optimization of Eigenvalues. 88-120 - Helga Schramm, Jochem Zowe:
A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results. 121-152 - Tilo Staib:
Necessary Optimality Conditions for Nonsmooth Multicriterial Optimization Problems. 153-171
Volume 2, Number 2, 1992
- Andrée Decarreau, Danielle Hilhorst, Claude Lemaréchal, Jorge Navaza:
Dual Methods in Entropy Maximization. Application to Some Problems in Crystallography. 173-197 - Michael J. Todd:
A Low Complexity Interior-Point Algorithm for Linear Programming. 198-209 - Richard H. Byrd, Richard A. Tapia, Yin Zhang:
An SQP Augmented Lagrangian BFGS Algorithm for Constrained Optimization. 210-241 - Andrew R. Conn, Yuying Li:
A Structure-Exploiting Algorithm for Nonlinear Minimax Problems. 242-263 - Alain Chalifour, Michel C. Delfour:
Optimal Distribution of Larvicide in Running Waters. 264-303 - Yin Zhang, Richard A. Tapia, John E. Dennis Jr.:
On the Superlinear and Quadratic Convergence of Primal-Dual Interior Point Linear Programming Algorithms. 304-324 - James V. Burke:
A Robust Trust Region Method for Constrained Nonlinear Programming Problems. 325-347
Volume 2, Number 3, 1992
- Clóvis C. Gonzaga, Michael J. Todd:
An (O√(n) L)-Iteration Large-Step Primal-Dual Affine Algorithm for Linear Programming. 349-359 - Jianxin Zhou, Guoqiang Tian:
Transfer Method for Characterizing the Existence of Maximal Elements of Binary Relations on Compact or Noncompact Sets. 360-375 - Kazufumi Ito, Karl Kunisch:
On the Choice of the Regularization Parameter in Nonlinear Inverse Problems. 376-404 - Alberto Seeger:
Second Derivatives of a Convex Function and of Its Legendre-Fenchel Transformate. 405-424 - Paul Tseng:
On the Convergence of the Products of Firmly Nonexpansive Mappings. 425-434 - Irvin J. Lustig
On Implementing Mehrotra's Predictor-Corrector Interior-Point Method for Linear Programming. 435-449 - Stephen J. Wright:
An Interior-Point Algorithm for Linearly Constrained Optimization. 450-473 - Martin Grötschel, Clyde L. Monma, Mechthild Stoer:
Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints. 474-504 - D. M. Hwang, Carl T. Kelley:
Convergence of Broyden's Method in Banach Spaces. 505-532
Volume 2, Number 4, 1992
- Richard H. Byrd, Dong C. Liu, Jorge Nocedal:
On the Behavior of Broyden's Class of Quasi-Newton Methods. 533-557 - Stefano Lucidi
New Results on a Continuously Differentiable Exact Penalty Function. 558-574 - Sanjay Mehrotra:
On the Implementation of a Primal-Dual Interior Point Method. 575-601 - Achiya Dax:
On Regularized Least Norm Problems. 602-618 - M. Seetharama Gowda:
On the Continuity of the Solution Map in Linear Complementarity Problems. 619-634 - Uriel G. Rothblum:
Linear Inequality Scaling Problems. 635-648 - Osman Güler:
New Proximal Point Algorithms for Convex Minimization. 649-664 - Jack Warga:
A Necessary and Sufficient Condition for a Constrained Minimum. 665-667 - Leonid Khachiyan, Bahman Kalantari:
Diagonal Matrix Scaling and Linear Programming. 668-672
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-01-14 21:15 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: