dblp: SIAM Journal on Optimization, Volume 21

J. Carsten Ziems, Stefan Ulbrich: Adaptive Multilevel Inexact SQP Methods for PDE-Constrained Optimization. 1-40

C. G. Liu, K. F. Ng: Ekeland's Variational Principle for Set-Valued Functions. 41-56

Min Tao, Xiaoming Yuan: Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations. 57-81

Ming-Jun Lai, Jingyue Wang: An Unconstrained $\ell_q$ Minimization with $0q\leq1$ for Sparse Solution of Underdetermined Linear Systems. 82-101

Chee-Khian Sim: Superlinear Convergence of an Infeasible Predictor-Corrector Path-Following Interior Point Algorithm for a Semidefinite Linear Complementarity Problem Using the Helmberg--Kojima--Monteiro Direction. 102-126

Xiaojun Chen, Robert S. Womersley, Jane J. Ye: Minimizing the Condition Number of a Gram Matrix. 127-148

Hedy Attouch, Marc-Olivier Czarnecki, Juan Peypouquet: Prox-Penalization and Splitting Methods for Constrained Variational Problems. 149-173

Massimo Marinacci, Luigi Montrucchio: Necessary and Sufficient Conditions for Optima in Reflexive Spaces. 174-192

Hubertus Th. Jongen, Vladimir Shikhman: Generalized Semi-Infinite Programming: The Nonsmooth Symmetric Reduction Ansatz. 193-211

Yasushi Narushima, Hiroshi Yabe, John A. Ford: A Three-Term Conjugate Gradient Method with Sufficient Descent Property for Unconstrained Optimization. 212-230

Garud Iyengar, David J. Phillips, Clifford Stein: Approximating Semidefinite Packing Programs. 231-268

Anton Schiela, W. Wollner: Barrier Methods for Optimal Control Problems with Convex Nonlinear Gradient State Constraints. 269-286

N. S. Aybat, Garud Iyengar: A First-Order Smoothed Penalty Method for Compressed Sensing. 287-313

Leonid Minchenko, Sergey Stakhovski: Parametric Nonlinear Programming Problems under the Relaxed Constant Rank Condition. 314-332

Dimitri P. Bertsekas, Huizhen Yu: A Unifying Polyhedral Approximation Framework for Convex Optimization. 333-360

María D. González-Lima, William W. Hager, Hongchao Zhang: An Affine-Scaling Interior-Point Method for Continuous Knapsack Constraints with Application to Support Vector Machines. 361-390

Bissan Ghaddar, Juan C. Vera, Miguel F. Anjos: Second-Order Cone Relaxations for Binary Quadratic Polynomial Programs. 391-414

R. Baker Kearfott: Erratum: Validated Linear Relaxations and Preprocessing: Some Experiments. 415-416

Philipp Rostalski, Ioannis A. Fotiou, Daniel J. Bates, A. Giovanni Beccuti, Manfred Morari: Numerical Algebraic Geometry for Optimal Control Applications. 417-437

Xianfu Wang: Self-dual Regularization of Monotone Operators via the Resolvent Average. 438-462

Alberto Lovison: Singular Continuation: Generating Piecewise Linear Approximations to Pareto Sets via Global Analysis. 463-490

Michael Hintermüller, V. A. Kovtunenko, Karl Kunisch: Obstacle Problems with Cohesion: A Hemivariational Inequality Approach and Its Efficient Numerical Solution. 491-516

Welington Luis de Oliveira, Claudia A. Sagastizábal, Susana Scheimberg: Inexact Bundle Methods for Two-Stage Stochastic Programming. 517-544

Xinwei Liu, Yaxiang Yuan: A Sequential Quadratic Programming Method Without A Penalty Function or a Filter for Nonlinear Equality Constrained Optimization. 545-571

Venkat Chandrasekaran, Sujay Sanghavi, Pablo A. Parrilo, Alan S. Willsky: Rank-Sparsity Incoherence for Matrix Decomposition. 572-596

A. S. Lewis, S. J. Wright: Identifying Activity. 597-614

Matthias Gerdts: Erratum: Global Convergence of a Nonsmooth Newton Method for Control-State Constrained Optimal Control Problems. 615-616

Qie He, Shabbir Ahmed, George L. Nemhauser: A Probabilistic Comparison of Split and Type 1 Triangle Cuts for Two-Row Mixed-Integer Programs. 617-632

Satoko Moriguchi, Akiyoshi Shioura, Nobuyuki Tsuchimura: M-Convex Function Minimization by Continuous Relaxation Approach: Proximity Theorem and Algorithm. 633-668

Yongchao Liu, Huifu Xu, Gui-Hua Lin: Stability Analysis of Two-Stage Stochastic Mathematical Programs with Complementarity Constraints via NLP Regularization. 669-705

Yong Xia, Xiaoling Sun, Duan Li, Xiaojin Zheng: On The Reduction of Duality Gap in Box Constrained Nonconvex Quadratic Program. 706-729

D. H. Fang, C. Li, X. Q. Yang: Stable and Total Fenchel Duality for DC Optimization Problems in Locally Convex Spaces. 730-760

Stefan M. Wild, Christine A. Shoemaker: Global Convergence of Radial Basis Function Trust Region Derivative-Free Algorithms. 761-781

Chong Li, K. F. Ng: Subdifferential Calculus Rules for Supremum Functions in Convex Analysis. 782-797

Jirí V. Outrata, Héctor Ramírez Cabrera: On the Aubin Property of Critical Points to Perturbed Second-Order Cone Programs. 798-823

Etienne de Klerk, Monique Laurent: On the Lasserre Hierarchy of Semidefinite Programming Relaxations of Convex Polynomial Optimization Problems. 824-832

A. Guerra, A. M. Newman, S. Leyffer: Concrete Structure Design using Mixed-Integer Nonlinear Programming with Complementarity Constraints. 833-863

Jean B. Lasserre: A New Look at Nonnegativity on Closed Sets and Polynomial Optimization. 864-885

Xi Yin Zheng, Kung Fu Ng: A Unified Separation Theorem for Closed Sets in a Banach Space and Optimality Conditions for Vector Optimization. 886-911

Serge Gratton, Annick Sartenaer, J. Tshimanga: On A Class of Limited Memory Preconditioners For Large Scale Linear Systems With Multiple Right-Hand Sides. 912-935

Sebastian Sager, Carola M. Barth, Holger Diedam, Michael Engelhart, Joachim Funke: Optimization as an Analysis Tool for Human Complex Problem Solving. 936-959

João Gouveia, Tim Netzer: Positive Polynomials and Projections of Spectrahedra. 960-976

Richard H. Byrd, Gillian M. Chin, Will Neveitt, Jorge Nocedal: On the Use of Stochastic Hessian Information in Optimization Methods for Machine Learning. 977-995

Warren Scott, Peter Frazier, Warren B. Powell: The Correlated Knowledge Gradient for Simulation Optimization of Continuous Parameters using Gaussian Process Regression. 996-1026

David Hartvigsen, Yanjun Li: Maximum Cardinality Simple 2-matchings in Subcubic Graphs. 1027-1045

Jayash Koshal, Angelia Nedic, Uday V. Shanbhag: Multiuser Optimization: Distributed Algorithms and Error Analysis. 1046-1081

Axel Dreves, Francisco Facchinei, Christian Kanzow, Simone Sagratella: On the solution of the KKT conditions of generalized Nash equilibrium problems. 1082-1108

A. L. Custódio, J. F. A. Madeira, A. Ismael F. Vaz, Luís N. Vicente: Direct Multisearch for Multiobjective Optimization. 1109-1140

Peter Richtárik: Improved Algorithms for Convex Minimization in Relative Scale. 1141-1167

Uma Ravat, Uday V. Shanbhag: On the Characterization of Solution Sets of Smooth and Nonsmooth Convex Stochastic Nash Games. 1168-1199

Ewout van den Berg, Michael P. Friedlander: Sparse Optimization with Least-Squares Constraints. 1201-1229

Luis M. Briceño-Arias, Patrick L. Combettes: A Monotone+Skew Splitting Model for Composite Monotone Inclusions in Duality. 1230-1250

Hedy Attouch, Marc-Olivier Czarnecki, Juan Peypouquet: Coupling Forward-Backward with Penalty Schemes and Parallel Splitting for Constrained Variational Inequalities. 1251-1274

Yongdo Lim: Maximum-Volume Symmetric Gauge Ball Problem on the Convex Cone of Positive Definite Matrices and Convexity of Optimal Sets. 1275-1288

Shoham Sabach: Products of Finitely Many Resolvents of Maximal Monotone Mappings in Reflexive Banach Spaces. 1289-1308

Xiao-Ming Yuan, Min Li: An LQP-Based Decomposition Method for Solving a Class of Variational Inequalities. 1309-1318

Gábor Kassay, Simeon Reich, Shoham Sabach: Iterative Methods for Solving Systems of Variational Inequalities in Reflexive Banach Spaces. 1319-1344

A. D. Ioffe: Regularity on a Fixed Set. 1345-1370

Mihály Csaba Markót, Hermann Schichl: Comparison and Automated Selection of Local Optimization Solvers for Interval Global Optimization Methods. 1371-1391

Shujun Bi, Shaohua Pan, Jein-Shan Chen: Nonsingularity Conditions for the Fischer-Burmeister System of Nonlinear SDPs. 1392-1417

Annabella Astorino, Antonio Frangioni, Manlio Gaudioso, Enrico Gorgone: Piecewise-quadratic Approximations in Convex Numerical Optimization. 1418-1438

Helmut Gfrerer: First Order and Second Order Characterizations of Metric Subregularity and Calmness of Constraint Set Mappings. 1439-1474

Cheng Lu, Shu-Cherng Fang, Qingwei Jin, Zhenbo Wang, Wenxun Xing: KKT Solution and Conic Relaxation for Solving Quadratically Constrained Quadratic Programming Problems. 1475-1490

Jong-Shi Pang, Gesualdo Scutari: Nonconvex Games with Side Constraints. 1491-1522

Chong Li, Boris S. Mordukhovich, Jinhua Wang, Jen-Chih Yao: Weak Sharp Minima on Riemannian Manifolds. 1523-1560

Michael Hintermüller, Thomas Surowiec: First-Order Optimality Conditions for Elliptic Mathematical Programs with Equilibrium Constraints via Variational Analysis. 1561-1593

Marco Di Summa, Laurence A. Wolsey: Mixing Sets Linked by Bidirected Paths. 1594-1613

Massimo Fornasier, Holger Rauhut, Rachel Ward: Low-rank Matrix Recovery via Iteratively Reweighted Least Squares Minimization. 1614-1640

Qingna Li, Houduo Qi: A Sequential Semismooth Newton Method for the Nearest Low-rank Correlation Matrix Problem. 1641-1666

Michael Chen, Sanjay Mehrotra: Self-concordance and Decomposition-based Interior Point Methods for the Two-stage Stochastic Convex Optimization Problem. 1667-1687

Renato D. C. Monteiro, Benar Fux Svaiter: Complexity of Variants of Tseng's Modified F-B Splitting and Korpelevich's Methods for Hemivariational Inequalities with Applications to Saddle-point and Convex Optimization Problems. 1688-1720

Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint: On the Evaluation Complexity of Composite Function Minimization with Applications to Nonconvex Nonlinear Programming. 1721-1739

SIAM Journal on Optimization, Volume 21

Volume 21, Number 1, 2011

Volume 21, Number 2, 2011

Volume 21, Number 3, 2011

Volume 21, Number 4, 2011