dblp: SIAM Journal on Optimization, Volume 12

Kung Fu Ng, Xi Yin Zheng: Error Bounds for Lower Semicontinuous Functions in Normed Spaces. 1-17

Lisa Fleischer: Faster Algorithms for the Quickest Transshipment Problem. 18-35

Stephen J. Wright: Effects of Finite-Precision Arithmetic on Interior-Point Methods for Nonlinear Programming. 36-78

Aharon Ben-Tal, Tamar Margalit, Arkadi Nemirovski: The Ordered Subsets Mirror Descent Optimization Method with Applications to Tomography. 79-108

Angelia Nedic, Dimitri P. Bertsekas: Incremental Subgradient Methods for Nondifferentiable Optimization. 109-138

Boris S. Mordukhovich, Jirí V. Outrata: On Second-Order Subdifferentials and Their Applications. 139-169

Asen L. Dontchev, R. Tyrrell Rockafellar: Ample Parameterization of Variational Inclusions. 170-187

William W. Hager: Minimizing a Quadratic Over a Sphere. 188-208

Philip E. Gill, Michael W. Leonard: Reduced-Hessian Quasi-Newton Methods for Unconstrained Optimization. 209-237

Paulo José da Silva e Silva, Jonathan Eckstein, Carlos Humes Jr.: Rescaling and Stepsize Selection in Proximal Methods Using Separable Generalized Distances. 238-261

Ilya Ioslovich: Robust Reduction of a Class of Large-Scale Linear Programs. 262-282

Matthias Heinkenschloss, Luís N. Vicente: Analysis of Inexact Trust-Region SQP Algorithms. 283-302

Roberto Andreani, Ana Friedlander, Sandra Augusta Santos: On the Resolution of the Generalized Nonlinear Complementarity Problem. 303-321

Victoria C. P. Chen: Measuring the Goodness of Orthogonal Array Discretizations for Stochastic Programming and Stochastic Dynamic Programming. 322-344

Monique Laurent: Tighter Linear and Semidefinite Relaxations for Max-Cut Based on the Lov[a-acute]sz--Schrijver Lift-and-Project Procedure. 345-375

Gianni Di Pillo, Stefano Lucidi: An Augmented Lagrangian Function with Improved Exactness Properties. 376-406

Aris Daniilidis, Nicolas Hadjisavvas, Juan Enrique Martínez-Legaz: An Appropriate Subdifferential for Quasiconvex Functions. 407-420

Zili Wu, Jane J. Ye: Sufficient Conditions for Error Bounds. 421-435

Masao Fukushima, Zhi-Quan Luo, Paul Tseng: Smoothing Functions for Second-Order-Cone Complementarity Problems. 436-460

A. D. Ioffe, R. E. Lucchetti, J. P. Revalski: A Variational Principle for Problems with Functional Constraints. 461-478

Anton J. Kleywegt, Alexander Shapiro, Tito Homem-de-Mello: The Sample Average Approximation Method for Stochastic Discrete Optimization. 479-502

Samuel Burer, Renato D. C. Monteiro, Yin Zhang: Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs. 503-521

Felipe Cucker, Javier Peña: A Primal-Dual Algorithm for Solving Polyhedral Conic Systems with a Finite-Precision Machine. 522-554

Krister Svanberg: A Class of Globally Convergent Optimization Methods Based on Conservative Convex Separable Approximations. 555-573

Joël Benoist, Aris Daniilidis: Integration of Fenchel Subdifferentials of Epi-Pointed Functions. 575-582

Stephen C. Billups: A Homotopy-Based Algorithm for Mixed Complementarity Problems. 583-605

Stephen C. Billups, Layne T. Watson: A Probability-One Homotopy Algorithm for Nonsmooth Equations and Mixed Complementarity Problems. 606-626

Marina Epelman, Robert M. Freund: A New Condition Measure, Preconditioners, and Relations Between Different Measures of Conditioning for Conic Linear Systems. 627-655

Huynh van Ngai, Michel Théra: A Fuzzy Necessary Optimality Condition for Non-Lipschitz Optimization in Asplund Spaces. 656-668

Kim-Chuan Toh, Masakazu Kojima: Solving Some Large Scale Semidefinite Programs via the Conjugate Residual Method. 669-691

E. Alper Yildirim, Michael J. Todd: An Interior-Point Approach to Sensitivity Analysis in Degenerate Linear Programs. 692-714

Raphael A. Hauser, Yongdo Lim: Self-Scaled Barriers for Irreducible Symmetric Cones. 715-723

Masao Fukushima, Paul Tseng: An Implementable Active-Set Algorithm for Computing a B-Stationary Point of a Mathematical Program with Linear Complementarity Constraints. 724-739

Lingjie Li, Zhi-Quan Luo, Timothy N. Davidson, Kon Max Wong, Éloi Bossé: Robust Filtering via Semidefinite Programming with Applications to Target Tracking. 740-755

Jean B. Lasserre: An Explicit Equivalent Positive Semidefinite Program for Nonlinear 0-1 Programs. 756-769

Leonid Faybusovich: Self-Concordant Barriers for Cones Generated by Chebyshev Systems. 770-781

E. Alper Yildirim, Stephen J. Wright: Warm-Start Strategies in Interior-Point Methods for Linear Programming. 782-810

Aharon Ben-Tal, Arkadi Nemirovski: On Tractable Approximations of Uncertain Linear Matrix Inequalities Affected by Interval Uncertainty. 811-833

James A. Tzitzouris, Jong-Shi Pang: A Time-Stepping Complementarity Approach for Frictionless Systems of Rigid Bodies. 834-860

A. B. Levy: Scaled Stability in Variational Problems. 861-874

Etienne de Klerk, Dmitrii V. Pasechnik: Approximation of the Stability Number of a Graph via Copositive Programming. 875-892

Yun-Bin Zhao, Duan Li: Locating the Least 2-Norm Solution of Linear Programs via a Path-Following Method. 893-912

D. Azé, Jean-Noël Corvellec: On the Sensitivity Analysis of Hoffman Constants for Systems of Linear Inequalities. 913-927

Alessio Massaro, Marcello Pelillo, Immanuel M. Bomze: A Complementary Pivoting Approach to the Maximum Weight Clique Problem. 928-948

Mihai Anitescu: A Superlinearly Convergent Sequential Quadratically Constrained Quadratic Programming Algorithm for Degenerate Nonlinear Programming. 949-978

Philip E. Gill, Walter Murray, Michael A. Saunders: SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization. 979-1006

Mituhiro Fukuda, Masakazu Kojima, Masayuki Shida: Lagrangian Dual Interior-Point Methods for Semidefinite Programs. 1007-1031

Qiji J. Zhu: Necessary Conditions for Constrained Optimization Problems in Smooth Banach Spaces and Applications. 1032-1047

Friedemann Leibfritz, El-Sayed M. E. Mostafa: An Interior Point Constrained Trust Region Method for a Special Class of Nonlinear Semidefinite Programming Problems. 1048-1074

Robert Michael Lewis, Virginia Torczon: A Globally Convergent Augmented Lagrangian Pattern Search Algorithm for Optimization with General Constraints and Simple Bounds. 1075-1089

Margaréta Halická, Etienne de Klerk, Cees Roos: On the Convergence of the Central Path in Semidefinite Optimization. 1090-1099

Francisco Facchinei, Stefano Lucidi, Laura Palagi: A Truncated Newton Algorithm for Large Scale Box Constrained Optimization. 1100-1125

Kim-Chuan Toh, Gongyun Zhao, Jie Sun: A Multiple-Cut Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems. 1126-1146

SIAM Journal on Optimization, Volume 12

Volume 12, Number 1, 2001

Volume 12, Number 2, 2002

Volume 12, Number 3, 2002

Volume 12, Number 4, 2002