Journal: SIAM Journal on Optimization

Volume 26, Issue 2

891 -- 921Silvia Bonettini, Ignace Loris, Federica Porta, Marco Prato. Variable Metric Inexact Line-Search-Based Methods for Nonsmooth Optimization
922 -- 950Min Li, Defeng Sun, Kim-Chuan Toh. A Majorized ADMM with Indefinite Proximal Terms for Linearly Constrained Convex Composite Optimization
951 -- 967Ernesto G. Birgin, J. L. Gardenghi, J. M. Martínez, S. A. Santos, Ph. L. Toint. Evaluation Complexity for Nonlinear Constrained Optimization Using Unscaled KKT Conditions and High-Order Models
968 -- 985Heinz H. Bauschke, Walaa M. Moursi. The Douglas-Rachford Algorithm for Two (Not Necessarily Intersecting) Affine Subspaces
986 -- 1007Duong Thi Kim Huyen, Nguyen Dong Yen. Coderivatives and the Solution Map of a Linear Constraint System
1008 -- 1031Richard H. Byrd, S. L. Hansen, Jorge Nocedal, Yoram Singer. A Stochastic Quasi-Newton Method for Large-Scale Optimization
1032 -- 1059Boris S. Mordukhovich, T. T. A. Nghia. Local Monotonicity and Full Stability for Parametric Variational Systems
1060 -- 1071N. T. T. Huong, Jen-Chih Yao, Nguyen Dong Yen. Polynomial Vector Variational Inequalities under Polynomial Constraints and Applications
1072 -- 1100Defeng Sun, Kim-Chuan Toh, Liuqin Yang. An Efficient Inexact ABCD Method for Least Squares Semidefinite Programming
1101 -- 1127Boris Houska, Janick V. Frasch, Moritz Diehl. An Augmented Lagrangian Based Algorithm for Distributed NonConvex Optimization
1128 -- 1146Sadik Iliman, Timo de Wolff. Lower Bounds for Polynomials with Simplex Newton Polytopes Based on Geometric Programming
1147 -- 1173Venkat Chandrasekaran, Parikshit Shah. Relative Entropy Relaxations for Signomial Optimization
1174 -- 1206Shimrit Shtern, Aharon Ben-Tal. Computational Methods for Solving Nonconvex Block-Separable Constrained Quadratic Problems
1207 -- 1235Yaohua Hu, Chong Li, Xiaoqi Yang. On Convergence Rates of Linearized Proximal Algorithms for Convex Composite Optimization with Applications
1236 -- 1256Jiawang Nie, Xinzhen Zhang. Positive Maps and Separable Matrices
1257 -- 1261Dávid Papp. On the Complexity of Local Search in Unconstrained Quadratic Binary Optimization
1262 -- 1292Kazufumi Ito, Karl Kunisch. A Sequential Method for a Class of Stable Mathematical Programming Problems
1293 -- 1311Pirro Oppezzi, Anna Maria Rossi. Existence and Convergence of Optimal Points with Respect to Improvement Sets
1312 -- 1321Rafael Correa, Abderrahim Hantoute, Pedro Pérez-Aros. On the Klee-Saint Raymond's Characterization of Convexity
1322 -- 1340Thibaut Vidal, Patrick Jaillet, Nelson Maculan. A Decomposition Algorithm for Nested Resource Allocation Problems
1341 -- 1364C. Planiden, X. Wang. Strongly Convex Functions, Moreau Envelopes, and the Generic Nature of Convex Functions with Strong Minimizers
1365 -- 1378Ovidiu Cârja, T. Donchev, A. I. Lazu. Generalized Solutions of Semilinear Evolution Inclusions
1379 -- 1409Guanghui Lan, Yi Zhou. Conditional Gradient Sliding for Convex Optimization