default search action
SIAM Journal on Optimization, Volume 7
Volume 7, Number 1, 1997
- Virginia Torczon:
On the Convergence of Pattern Search Algorithms. 1-25 - Marcos Raydan
:
The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem. 26-33 - Walter F. Mascarenhas:
The Affine Scaling Algorithm Fails for Stepsize 0.999. 34-46 - Clóvis C. Gonzaga, Richard A. Tapia:
On the Convergence of the Mizuno-Todd-Ye Algorithm to the Analytic Center of the Solution Set. 47-65 - Clóvis C. Gonzaga, Richard A. Tapia:
On the Quadratic Convergence of the Simplified Mizuno-Todd-Ye Algorithm for Linear Programming. 66-85 - Masakazu Kojima, Susumu Shindoh, Shinji Hara
Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices. 86-125 - Benjamin Jansen, Cornelis Roos, Tamás Terlaky:
A Family of Polynomial Affine Scaling Algorithms for Positive SemiDefinite Linear Complementarity Problems. 126-140 - Danny C. Sorensen:
Minimization of a Large-Scale Quadratic FunctionSubject to a Spherical Constraint. 141-161 - Anders Forsgren, Walter Murray:
Newton Methods For Large-Scale Linear Inequality-Constrained Minimization. 162-176 - John E. Dennis Jr., Mahmoud El-Alem
A Global Convergence Theory for General Trust-Region-Based Algorithms for Equality Constrained Optimization. 177-207 - Mårten Gulliksson
Algorithms for Constrained and Weighted Nonlinear Least Squares. 208-224 - Francisco Facchinei, João Soares:
A New Merit Function For Nonlinear Complementarity Problems And A Related Algorithm. 225-247 - Thomas L. Magnanti, Georgia Perakis:
The Orthogonality Theorem and the Strong-f-Monotonicity Condition for Variational Inequality Algorithms. 248-273 - Sien Deng:
Computable Error Bounds For Convex Inequality Systems In Reflexive Banach Spaces. 274-279 - Panos M. Pardalos, K. G. Ramakrishnan, Mauricio G. C. Resende, Yong Li:
Implementation of a Variance Reduction-Based Lower Bound in a Branch-and-Bound Algorithm for the Quadratic Assignment Problem. 280-294
Volume 7, Number 2, 1997
- Osman Güler:
On the Self-Concordance of the Universal Barrier Function. 295-303 - Rongqin Sheng, Florian A. Potra:
A Quadratically Convergent Infeasible-Interior-Point Algorithm for LCP with Polynomial Complexity. 304-317 - Florian A. Potra, Rongqin Sheng:
A Large-Step Infeasible-Interior-Point Method for the P*-Matrix LCP. 318-335 - Krzysztof C. Kiwiel:
Efficiency of the Analytic Center Cutting Plane Method for Convex Minimization. 336-346 - Aharon Ben-Tal, Michael Zibulevsky:
Penalty/Barrier Multiplier Methods for Convex Programming Problems. 347-366 - Claude Lemaréchal, Claudia A. Sagastizábal:
Practical Aspects of the Moreau-Yosida Regularization: Theoretical Preliminaries. 367-385 - Paul Tseng:
An Infeasible Path-Following Method for Monotone Complementarity Problems. 386-402 - Bintong Chen, Patrick T. Harker:
Smooth Approximations to Nonlinear Complementarity Problems. 403-420 - George H.-G. Chen, R. Tyrrell Rockafellar
Convergence Rates in Forward-Backward Splitting. 421-444 - Xiaojun Chen
Convergence of Newton's Method for Singular Smooth and Nonsmooth Equations Using Adaptive Outer Inverses. 445-462 - Defeng Sun
Newton and Quasi-Newton Methods for a Class of Nonsmooth Equations and Related Problems. 463-480 - Jane J. Ye
Exact Penalization and Necessary Optimality Conditions for Generalized Bilevel Programming Problems. 481-507 - Alexander Shapiro:
On Uniqueness of Lagrange Multipliers in Optimization Problems Subject to Cone Constraints. 508-518 - Julian P. Revalski:
Hadamard and Strong Well-Posedness for Convex Programs. 519-526 - Tuvia Kotzer, Nir Cohen, Joseph Shamir:
A Projection-Based Algorithm for Consistent and Inconsistent Constraints. 527-546 - T. C. Edwin Cheng
Single Machine Scheduling to Minimize Batch Delivery and Job Earliness Penalties. 547-559 - Franco Blanchini, Franca Rinaldi, Walter Ukovich:
A Network Design Problem for a Distribution System with Uncertain Demands. 560-578
Volume 7, Number 3, 1997
- Ji-Ming Peng, Ya-Xiang Yuan:
Optimality Conditions for the Minimization of a Quadratic with Two Quadratic Constraints. 579-594 - Wu Li, John Swetits:
A New Algorithm for Solving Strictly Convex Quadratic Programs. 595-619 - Evangelia M. Simantiraki, David F. Shanno:
An Infeasible-Interior-Point Method for Linear Complementarity Problems. 620-640 - Motakuri V. Ramana, Levent Tunçel
Strong Duality for Semidefinite Programming. 641-662 - Renato D. C. Monteiro:
Primal-Dual Path-Following Algorithms for Semidefinite Programming. 663-678 - Alberto Seeger:
Convex Analysis of Spectrally Defined Matrix Functions. 679-696 - Zhi-Quan Luo:
Analysis of a Cutting Plane Method That Uses Weighted Analytic Center and Multiple Cuts. 697-716 - J. Frédéric Bonnans, Cecilia Pola
A Trust Region Interior Point Algorithm for Linearly Constrained Optimization. 717-731 - Ali Bouaricha:
Tensor Methods for Large, Sparse Unconstrained Optimization. 732-756 - Dan Feng, Thomas H. Pulliam:
Tensor-GMRES Method for Large Systems of Nonlinear Equations. 757-779 - Jean Charles Gilbert
On the Realization of the Wolfe Conditions in Reduced Quasi-Newton Methods for Equality Constrained Optimization. 780-813 - Jorge J. Moré, Zhijun Wu:
Global Continuation for Distance Geometry Problems. 814-836 - Tankred Rautert, Ekkehard W. Sachs:
Computational Design of Optimal Output Feedback Controllers. 837-852 - Dimitri P. Bertsekas, Lazaros C. Polymenakos, Paul Tseng:
An ε-Relaxation Method for Separable Convex Cost Network Flow Problems. 853-870 - Zdenek Dostál
Box Constrained Quadratic Programming with Proportioning and Projections. 871-887
Volume 7, Number 4, 1997
- Malcolm Craig Pullan:
A Study of General Dynamic Network Programs with Arc Time-Delays. 889-912 - Dimitri P. Bertsekas:
A New Class of Incremental Gradient Methods for Least Squares Problems. 913-926 - John E. Dennis, Luís Nunes Vicente
On the Convergence Theory of Trust-Region-Based Algorithms for Equality-Constrained Optimization. 927-950 - Paul Tseng:
Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities. 951-965 - Wu Li:
Abadie's Constraint Qualification, Metric Regularity, and Error Bounds for Differentiable Convex Inequalities. 966-978 - J. Frédéric Bonnans:
Mathematical Study of Very High Voltage Power Networks I: The Optimal DC Power Flow Problem. 979-990 - Aharon Ben-Tal, Arkadi Nemirovski
Robust Truss Topology Design via Semidefinite Programming. 991-1016 - Guoliang Xue, Yinyu Ye:
An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications. 1017-1036 - François Chapeau-Blondeau
A Dynamic Adaptive Relaxation Scheme Applied to the Euclidean Steiner Minimal Tree Problem. 1037-1053 - Jia Feng Weng:
Shortest Networks for Smooth Curves. 1054-1068 - Marc Teboulle:
Convergence of Proximal-Like Algorithms. 1069-1083 - Krzysztof C. Kiwiel, Bozena Lopuch:
Surrogate Projection Methods for Finding Fixed Points of Firmly Nonexpansive Mappings. 1084-1102 - Hubertus Th. Jongen, Oliver Stein:
On Generic One-Parametric Semi-Infinite Optimization. 1103-1137 - Miguel A. Goberna
Stability Theory for Linear Inequality Systems II: Upper Semicontinuity of the Solution Set Mapping. 1138-1151 - Ming-Hong Liu, Vasant A. Ubhaya:
Integer Isotone Optimization. 1152-1159
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-09 20:29 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: