default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSIAM Journal on Optimization, Volume 1
Volume 1, Number 1, 1991
- William C. Davidon:
Variable Metric Method for Minimization. 1-17 - Roger Fletcher:
A New Variational Result for Quasi-Newton Formulae. 18-21 - Kurt M. Anstreicher:
On the Performance of Karmarkar's Algorithm over a Sequence of Iterations. 22-29 - Vaithilingam Jeyakumar
:
Composite Nonsmooth Programming with Gâteaux Differentiability. 30-41 - John R. Engels, Héctor J. Martínez:
Local and Superlinear Convergence for Partially Known Quasi-Newton Methods. 42-56 - Jong-Shi Pang, Shih-Ping Han, Narayan Rangaraj:
Minimization of Locally Lipschitzian Functions. 57-82 - Jiu Ding, Tien-Yien Li:
A Polynomial-Time Predictor-Corrector Algorithm for a Class of Linear Complementarity Problems. 83-92 - Jorge J. Moré, Gerardo Toraldo:
On the Solution of Large Quadratic Programming Problems with Bound Constraints. 93-113 - Olvi L. Mangasarian:
Convergence of Iterates of an Inexact Matrix Splitting Algorithm for the Symmetric Monotone Linear Complementarity Problem. 114-122 - Virginia Torczon:
On the Convergence of the Multidirectional Search Algorithm. 123-145 - Carl T. Kelley, Ekkehard W. Sachs:
A New Proof of Superlinear Convergence for Broyden's Method in Hilbert Space. 146-150
Volume 1, Number 2, 1991
- Yang Dai, Gerard van der Laan, A. J. J. Talman, Yoshitsugu Yamamoto:
A Simplicial Algorithm for the Nonlinear Stationary Point Problem on an Unbounded Polyhedron. 151-165 - László Lovász, Alexander Schrijver:
Cones of Matrices and Set-Functions and 0-1 Optimization. 166-190 - Jonathan M. Borwein, Adrian S. Lewis:
Convergence of Best Entropy Estimates. 191-205 - Bing Yang, Lin Gao:
An Efficient Implementation of Merrill's Method for Sparse or Partially Separable Systems of Nonlinear Equations. 206-221 - Kashmira M. Irani, Manohar P. Kamat, Calvin J. Ribbens, Homer F. Walker, Layne T. Watson:
Experiments with Conjugate Gradient Algorithms for Homotopy Curve Tracking. 222-251 - Donald Goldfarb, Shucheng Liu, Siyun Wang:
A Logarithmic Barrier Function Algorithm for Quadratically Constrained Convex Quadratic Programming. 252-267 - Clóvis C. Gonzaga:
Large Step Path-Following Methods for Linear Programming, Part I: Barrier Function Method. 268-279 - Clóvis C. Gonzaga:
Large Step Path-Following Methods for Linear Programming, Part II: Potential Reduction Method. 280-292
Volume 1, Number 3, 1991
- Robert B. Schnabel, Ta-Tung Chow:
Tensor Methods for Unconstrained Optimization Using Second Derivatives. 293-315 - John L. Nazareth:
The Homotopy Principle and Algorithms for Linear Programming. 316-332 - John E. Dennis Jr., Nélida E. Echebest, M. T. Guardarucci, José Mario Martínez, Hugo D. Scolnik, M. C. Vacchino:
A Curvilinear Search Using Tridiagonal Secant Updates for Unconstrained Optimization. 333-357 - Stephen G. Nash, Jorge Nocedal:
A Numerical Study of the Limited Memory BFGS Method and the Truncated-Newton Method for Large Scale Optimization. 358-372 - Stavros A. Zenios, Yair Censor:
Massively Parallel Row-Action Algorithms for Some Nonlinear Transportation Problems. 373-400 - Alfredo N. Iusem:
On Dual Convergence and the Rate of Primal Convergence of Bregman's Convex Programming Method. 401-423
Volume 1, Number 4, 1991
- Dimitri P. Bertsekas:
An Auction Algorithm for Shortest Paths. 425-447 - John E. Dennis Jr., Virginia Torczon:
Direct Search Methods on Parallel Machines. 448-474 - L. C. W. Dixon:
On the Impact of Automatic Differentiation on the Relative Performance of Parallel Truncated Newton and Variable Metric Algorithms. 475-486 - Michael C. Ferris, Olvi L. Mangasarian:
Parallel Constraint Distribution. 487-500 - John H. Glick, Robert S. Maier, J. B. Rosen:
Parallel Solution of Large-Scale, Block-Diagonal Concave Maximization Problems. 501-514 - Prasanna Jog, Jung-Yul Suh, Dirk Van Gucht:
Parallel Genetic Algorithms Applied to the Traveling Salesman Problem. 515-529 - Stephen G. Nash, Ariela Sofer:
A General-Purpose Parallel Algorithm for Unconstrained Optimization. 530-547 - Yurii E. Nesterov, Arkadii Nemirovskii:
Acceleration and Parallelization of the Path-Following Interior Point Method for a Linearly Constrained Convex Quadratic Problem. 548-564 - James M. Ortega:
Orderings for Conjugate Gradient Preconditionings. 565-582 - Gary L. Schultz, Robert R. Meyer:
An Interior Point Method for Block Angular Optimization. 583-602 - Paul Tseng:
On the Rate of Convergence of a Partially Asynchronous Gradient Projection Algorithm. 603-619 - Stephen J. Wright:
Partitioned Dynamic Programming for Optimal Control. 620-642 - Stavros A. Zenios:
On the Fine-Grain Decomposition of Multicommodity Transportation Problems. 643-669
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-10-31 20:05 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:
