Journal: SIAM Journal on Optimization

Volume 23, Issue 2

687 -- 694Hector Ramirez, Alberto Seeger, David Sossa. Commutation Principle for Variational Problems on Euclidean Jordan Algebras
695 -- 720Laurent Sorber, Marc Van Barel, Lieven De Lathauwer. r, 1) Terms, and a New Generalization
721 -- 744Akshay Gupte, Shabbir Ahmed, Myun-Seok Cheon, Santanu Dey. Solving Mixed Integer Bilinear Problems Using MILP Formulations
745 -- 769Chek Beng Chua, Zhen Li. A Barrier-Based Smoothing Proximal Point Algorithm for NCPs over Closed Convex Cones
770 -- 798Christian Kanzow, Alexandra Schwartz. A New Regularization Method for Mathematical Programs with Complementarity Constraints with Strong Convergence Properties
799 -- 810Dennis Cheung, Felipe Cucker. On the Average Condition of Random Linear Programs
811 -- 833Amir Ali Ahmadi, Pablo A. Parrilo. A Complete Characterization of the Gap between Convexity and SOS-Convexity
834 -- 856Frank Göring, Christoph Helmberg, Susanna Reiss. On Minimizing the Spectral Width of Graph Laplacians and Associated Graph Realizations
857 -- 893Junfeng Yang, Defeng Sun, Kim-Chuan Toh. A Proximal Point Algorithm for Log-Determinant Optimization with Group Lasso Regularization
894 -- 916Ming Hu, Masao Fukushima. Existence, Uniqueness, and Computation of Robust Nash Equilibria in a Class of Multi-Leader-Follower Games
917 -- 933Hà Huy Vui. Global Hölderian Error Bound for Nondegenerate Polynomials
934 -- 962Michel Baes, Michael Bürgisser, Arkadi Nemirovski. A Randomized Mirror-Prox Method for Solving Structured Large-Scale Matrix Saddle-Point Problems
963 -- 999Sanjay Mehrotra, Dávid Papp. Generating Moment Matching Scenarios Using Optimization Techniques
1000 -- 1020Kai Kellner, Thorsten Theobald, Christian Trabandt. Containment Problems for Polytopes and Spectrahedra
1021 -- 1040Amitabh Basu, Robert Hildebrand, Matthias Köppe, Marco Molinaro. A (k+1)-Slope Theorem for the k-Dimensional Infinite Group Relaxation
1041 -- 1061Peter Fusek. On Metric Regularity for Weakly Almost Piecewise Smooth Functions and Some Applications in Nonlinear Semidefinite Programming
1062 -- 1091Lin Xiao, Tong Zhang 0001. A Proximal-Gradient Homotopy Method for the Sparse Least-Squares Problem
1092 -- 1125Renato D. C. Monteiro, Benar Fux Svaiter. An Accelerated Hybrid Proximal Extragradient Method for Convex Optimization and Its Implications to Second-Order Methods
1126 -- 1153Meisam Razaviyayn, Mingyi Hong, Zhi-Quan Luo. A Unified Convergence Analysis of Block Successive Minimization Methods for Nonsmooth Optimization
1154 -- 1166Rafael Correa, Pedro Gajardo, Lionel Thibault, Dariusz Zagrodny. Existence of Minimizers on Drops
1167 -- 1188Layne T. Watson, Stephen C. Billups, John E. Mitchell, David R. Easterling. A Globally Convergent Probability-One Homotopy for Linear Programs with Linear Complementarity Constraints
1189 -- 1213L. F. Bueno, Ana Friedlander, José Mario Martínez, F. N. C. Sobral. Inexact Restoration Method for Derivative-Free Optimization with Smooth Constraints
1214 -- 1236Bart Vandereycken. Low-Rank Matrix Completion by Riemannian Optimization
1237 -- 1256Chong Li, K. F. Ng. Approximate Solutions for Abstract Inequality Systems
1257 -- 1283J. Carsten Ziems. Adaptive Multilevel Inexact SQP-Methods for PDE-Constrained Optimization with Control Constraints
1284 -- 1309Sebastian U. Stich, Christian L. Müller, Bernd Gärtner. Optimization of Convex Functions with Random Pursuit
1310 -- 1343Leah Epstein, Asaf Levin. Robust Approximation Schemes for Cube Packing
1344 -- 1370Yao Yue, Karl Meerbergen. Accelerating Optimization of Parametric Linear Systems by Model Order Reduction