External Links

    Journal: SIAM Journal on Optimization

    Volume 7, Issue 4

    889 -- 912Malcolm C. Pullan. A Study of General Dynamic Network Programs with Arc Time-Delays
    913 -- 926Dimitri P. Bertsekas. A New Class of Incremental Gradient Methods for Least Squares Problems
    927 -- 950John E. Dennis, Luís N. Vicente. On the Convergence Theory of Trust-Region-Based Algorithms for Equality-Constrained Optimization
    951 -- 965Paul Tseng. Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities
    966 -- 978Wu Li. Abadie's Constraint Qualification, Metric Regularity, and Error Bounds for Differentiable Convex Inequalities
    979 -- 990J. Frédéric Bonnans. Mathematical Study of Very High Voltage Power Networks I: The Optimal DC Power Flow Problem
    991 -- 1016Aharon Ben-Tal, Arkadi Nemirovski. Robust Truss Topology Design via Semidefinite Programming
    1017 -- 1036Guoliang Xue, Yinyu Ye. An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications
    1037 -- 1053François Chapeau-Blondeau, Fabrice Janez, Jean-Louis Ferrier. A Dynamic Adaptive Relaxation Scheme Applied to the Euclidean Steiner Minimal Tree Problem
    1054 -- 1068Jia Feng Weng. Shortest Networks for Smooth Curves
    1069 -- 1083Marc Teboulle. Convergence of Proximal-Like Algorithms
    1084 -- 1102Krzysztof C. Kiwiel, Bozena Lopuch. Surrogate Projection Methods for Finding Fixed Points of Firmly Nonexpansive Mappings
    1103 -- 1137Hubertus Th. Jongen, Oliver Stein. On Generic One-Parametric Semi-Infinite Optimization
    1138 -- 1151Miguel A. Goberna, Marco A. López, Maxim I. Todorov. Stability Theory for Linear Inequality Systems II: Upper Semicontinuity of the Solution Set Mapping
    1152 -- 1159Ming-Hong Liu, Vasant A. Ubhaya. Integer Isotone Optimization

    Volume 7, Issue 3

    579 -- 594Ji-Ming Peng, Ya-Xiang Yuan. Optimality Conditions for the Minimization of a Quadratic with Two Quadratic Constraints
    595 -- 619Wu Li, John Swetits. A New Algorithm for Solving Strictly Convex Quadratic Programs
    620 -- 640Evangelia M. Simantiraki, David F. Shanno. An Infeasible-Interior-Point Method for Linear Complementarity Problems
    641 -- 662Motakuri V. Ramana, Levent Tunçel, Henry Wolkowicz. Strong Duality for Semidefinite Programming
    663 -- 678Renato D. C. Monteiro. Primal-Dual Path-Following Algorithms for Semidefinite Programming
    679 -- 696Alberto Seeger. Convex Analysis of Spectrally Defined Matrix Functions
    697 -- 716Zhi-Quan Luo. Analysis of a Cutting Plane Method That Uses Weighted Analytic Center and Multiple Cuts
    717 -- 731J. Frédéric Bonnans, Cecilia Pola. A Trust Region Interior Point Algorithm for Linearly Constrained Optimization
    732 -- 756Ali Bouaricha. Tensor Methods for Large, Sparse Unconstrained Optimization
    757 -- 779Dan Feng, Thomas H. Pulliam. Tensor-GMRES Method for Large Systems of Nonlinear Equations
    780 -- 813Jean Charles Gilbert. On the Realization of the Wolfe Conditions in Reduced Quasi-Newton Methods for Equality Constrained Optimization
    814 -- 836Jorge J. Moré, Zhijun Wu. Global Continuation for Distance Geometry Problems
    837 -- 852Tankred Rautert, Ekkehard W. Sachs. Computational Design of Optimal Output Feedback Controllers
    853 -- 870Dimitri P. Bertsekas, Lazaros C. Polymenakos, Paul Tseng. An ε-Relaxation Method for Separable Convex Cost Network Flow Problems
    871 -- 887Zdenek Dostál. Box Constrained Quadratic Programming with Proportioning and Projections

    Volume 7, Issue 2

    295 -- 303Osman Güler. On the Self-Concordance of the Universal Barrier Function
    304 -- 317Rongqin Sheng, Florian A. Potra. A Quadratically Convergent Infeasible-Interior-Point Algorithm for LCP with Polynomial Complexity
    318 -- 335Florian A. Potra, Rongqin Sheng. A Large-Step Infeasible-Interior-Point Method for the P*-Matrix LCP
    336 -- 346Krzysztof C. Kiwiel. Efficiency of the Analytic Center Cutting Plane Method for Convex Minimization
    347 -- 366Aharon Ben-Tal, Michael Zibulevsky. Penalty/Barrier Multiplier Methods for Convex Programming Problems
    367 -- 385Claude Lemaréchal, Claudia A. Sagastizábal. Practical Aspects of the Moreau-Yosida Regularization: Theoretical Preliminaries
    386 -- 402Paul Tseng. An Infeasible Path-Following Method for Monotone Complementarity Problems
    403 -- 420Bintong Chen, Patrick T. Harker. Smooth Approximations to Nonlinear Complementarity Problems
    421 -- 444George H.-G. Chen, R. Tyrrell Rockafellar. Convergence Rates in Forward-Backward Splitting
    445 -- 462Xiaojun Chen 0001, Zuhair Nashed, Liqun Qi. Convergence of Newton's Method for Singular Smooth and Nonsmooth Equations Using Adaptive Outer Inverses
    463 -- 480Defeng Sun, Jiye Han. Newton and Quasi-Newton Methods for a Class of Nonsmooth Equations and Related Problems
    481 -- 507Jane J. Ye, Daoli Zhu, Q. J. Zhu. Exact Penalization and Necessary Optimality Conditions for Generalized Bilevel Programming Problems
    508 -- 518Alexander Shapiro. On Uniqueness of Lagrange Multipliers in Optimization Problems Subject to Cone Constraints
    519 -- 526Julian P. Revalski. Hadamard and Strong Well-Posedness for Convex Programs
    527 -- 546Tuvia Kotzer, Nir Cohen, Joseph Shamir. A Projection-Based Algorithm for Consistent and Inconsistent Constraints
    547 -- 559T. C. Edwin Cheng, Mikhail Y. Kovalyov, Bertrand M. T. Lin. Single Machine Scheduling to Minimize Batch Delivery and Job Earliness Penalties
    560 -- 578Franco Blanchini, Franca Rinaldi, Walter Ukovich. A Network Design Problem for a Distribution System with Uncertain Demands

    Volume 7, Issue 1

    1 -- 25Virginia Torczon. On the Convergence of Pattern Search Algorithms
    26 -- 33Marcos Raydan. The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
    34 -- 46Walter F. Mascarenhas. The Affine Scaling Algorithm Fails for Stepsize 0.999
    47 -- 65Clóvis C. Gonzaga, Richard A. Tapia. On the Convergence of the Mizuno-Todd-Ye Algorithm to the Analytic Center of the Solution Set
    66 -- 85Clóvis C. Gonzaga, Richard A. Tapia. On the Quadratic Convergence of the Simplified Mizuno-Todd-Ye Algorithm for Linear Programming
    86 -- 125Masakazu Kojima, Susumu Shindoh, Shinji Hara. Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
    126 -- 140Benjamin Jansen, Cornelis Roos, Tamás Terlaky. A Family of Polynomial Affine Scaling Algorithms for Positive SemiDefinite Linear Complementarity Problems
    141 -- 161Danny C. Sorensen. Minimization of a Large-Scale Quadratic FunctionSubject to a Spherical Constraint
    162 -- 176Anders Forsgren, Walter Murray. Newton Methods For Large-Scale Linear Inequality-Constrained Minimization
    177 -- 207John E. Dennis Jr., Mahmoud El-Alem, María C. Maciel. A Global Convergence Theory for General Trust-Region-Based Algorithms for Equality Constrained Optimization
    208 -- 224Mårten Gulliksson, Inge Söderkvist, Per-Åke Wedin. Algorithms for Constrained and Weighted Nonlinear Least Squares
    225 -- 247Francisco Facchinei, João Soares. A New Merit Function For Nonlinear Complementarity Problems And A Related Algorithm
    248 -- 273Thomas L. Magnanti, Georgia Perakis. The Orthogonality Theorem and the Strong-f-Monotonicity Condition for Variational Inequality Algorithms
    274 -- 279Sien Deng. Computable Error Bounds For Convex Inequality Systems In Reflexive Banach Spaces
    280 -- 294Panos 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
    runs on