Journal: SIAM Journal on Optimization

Volume 29, Issue 4

2423 -- 2444Ronny Bergmann, Roland Herzog. Intrinsic Formulation of KKT Conditions and Constraint Qualifications on Smooth Manifolds
2445 -- 2481Stephen Becker, Jalal Fadili, Peter Ochs. On Quasi-Newton Forward-Backward Splitting: Proximal Calculus and Convergence
2482 -- 2503Peter Ochs, Thomas Pock. Adaptive FISTA for Nonconvex Optimization
2504 -- 2516Ewa M. Bednarczuk, K. E. Rutkowski. On Lipschitz-Like Property for Polyhedral Moving Sets
2517 -- 2541Orizon P. Ferreira, M. S. Louzeiro, L. F. Prudente. Gradient Method for Optimization on Riemannian Manifolds with Lower Bounded Curvature
2542 -- 2565Mert Gürbüzbalaban, Asuman E. Ozdaglar, Pablo A. Parrilo. Convergence Rate of Incremental Gradient and Incremental Newton Methods
2566 -- 2593Weiwei Kong, Jefferson G. Melo, Renato D. C. Monteiro. Complexity of a Quadratic Penalty Accelerated Inexact Proximal Point Method for Solving Linearly Constrained Nonconvex Composite Programs
2594 -- 2607Biel Roig-Solvas, Lee Makowski, Dana H. Brooks. A Proximal Operator for Multispectral Phase Retrieval Problems
2608 -- 2624Paul Breiding, Khazhgali Kozhasov, Antonio Lerario. Random Spectrahedra
2625 -- 2649Kuang Bai, Jane J. Ye, Jin Zhang 0002. Directional Quasi-/Pseudo-Normality as Sufficient Conditions for Metric Subregularity
2650 -- 2676Marcel Kenji de Carli Silva, Levent Tunçel. Strict Complementarity in Semidefinite Optimization with Elliptopes Including the MaxCut SDP
2677 -- 2696César Gutiérrez, Lidia Huerga, Vicente Novo, Miguel Sama. Limit Behavior of Approximate Proper Solutions in Vector Optimization
2697 -- 2724Minh N. Dao, Hung M. Phan. Adaptive Douglas-Rachford Splitting Algorithm for the Sum of Two Operators
2725 -- 2752Zhaosong Lu, Zirui Zhou. Nonmonotone Enhanced Proximal DC Algorithms for a Class of Structured Nonsmooth DC Programming
2753 -- 2784Guanghui Lan, Yu Yang. Accelerated Stochastic Algorithms for Nonconvex Finite-Sum and Multiblock Optimization
2785 -- 2813Ying Cui 0004, Defeng Sun, Kim-Chuan Toh. Computing the Best Approximation over the Intersection of a Polyhedral Set and the Doubly Nonnegative Cone
2814 -- 2852Ion Necoara, Peter Richtárik, Andrei Patrascu. Randomized Projection Methods for Convex Feasibility: Conditioning and Convergence Rates
2853 -- 2880Seyedehsomayeh Hosseini, André Uschmajew. A Gradient Sampling Method on Algebraic Varieties and Application to Nonsmooth Low-Rank Optimization
2881 -- 2915Stefania Bellavia, Gianmarco Gurioli, Benedetta Morini, Philippe L. Toint. Adaptive Regularization Algorithms with Inexact Evaluations for Nonconvex Optimization
2916 -- 2948Andre Milzarek, Xiantao Xiao, Shicong Cen, Zaiwen Wen, Michael Ulbrich. A Stochastic Semismooth Newton Method for Nonsmooth Nonconvex Optimization
2949 -- 2985Oliver Habeck, Marc E. Pfetsch, Stefan Ulbrich. Global Optimization of Mixed-Integer ODE Constrained Network Problems Using the Example of Stationary Gas Transport
2986 -- 3011Jein-Shan Chen, Jane J. Ye, Jin Zhang 0002, Jinchuan Zhou. Exact Formula for the Second-Order Tangent Set of the Second-Order Cone Complementarity Set
3012 -- 3035Giampaolo Liuzzi, Stefano Lucidi, Francesco Rinaldi, Luís Nunes Vicente. Trust-Region Methods for the Derivative-Free Optimization of Nonsmooth Black-Box Functions
3036 -- 3068Necdet Serhat Aybat, Erfan Yazdandoost Hamedani. A Distributed ADMM-like Method for Resource Sharing over Time-Varying Networks
3069 -- 3099Livia M. Betz. Strong Stationarity for Optimal Control of a Nonsmooth Coupled System: Application to a Viscous Evolutionary Variational Inequality Coupled with an Elliptic PDE
3100 -- 3130Matus Benko, Helmut Gfrerer, Boris S. Mordukhovich. Characterizations of Tilt-Stable Minimizers in Second-Order Cone Programming
3131 -- 3153Jean-François Aujol, Charles Dossal, Aude Rondepierre. Optimal Convergence Rates for Nesterov Acceleration
3154 -- 3173Alberto Del Pia. Subdeterminants and Concave Integer Quadratic Programming
3174 -- 3200Christian Kanzow, Daniel Steck. Quasi-Variational Inequalities in Banach Spaces: Theory and Augmented Lagrangian Methods
3201 -- 3230Roberto Andreani, Gabriel Haeser, Leonardo D. Secchin, Paulo J. S. Silva. New Sequential Optimality Conditions for Mathematical Programs with Complementarity Constraints and Algorithmic Consequences

Volume 29, Issue 3

1745 -- 1771Daniel Prusa, Tomás Werner. Solving LP Relaxations of Some NP-Hard Problems Is As Hard As Solving Any Linear Program
1772 -- 1798Luca Calatroni, Antonin Chambolle. Backtracking Strategies for Accelerated Descent Methods with Smooth Composite Objectives
1799 -- 1818Min Zhang, Jie Sun, Honglei Xu. Two-Stage Quadratic Games under Uncertainty and Their Solution by Progressive Hedging Algorithms
1819 -- 1843Dinh The Luc, Michel Volle. Duality for Optimization Problems with Infinite Sums
1844 -- 1869Long-Fei Wang, Yong Xia. A Linear-Time Algorithm for Globally Maximizing the Sum of a Generalized Rayleigh Quotient and a Quadratic Form on the Unit Sphere
1870 -- 1878Richard H. Byrd, Jorio Cocola, Richard A. Tapia. Extending the Pennisi-McCormick Second-Order Sufficiency Theory for Nonlinear Programming to Infinite Dimensions
1879 -- 1907Shuyang Ling, Ruitu Xu, Afonso S. Bandeira. On the Landscape of Synchronization Networks: A Perspective from Nonconvex Optimization
1908 -- 1930Damek Davis, Benjamin Grimmer. Proximally Guided Stochastic Subgradient Method for Nonsmooth, Nonconvex Problems
1931 -- 1957Patrick R. Johnstone, Jonathan Eckstein. Convergence Rates for Projective Splitting
1958 -- 1987James V. Burke, Yuan Gao, Tim Hoheisel. Variational Properties of Matrix Functions via the Generalized Matrix-Fractional Function
1988 -- 2025Marie-Ange Dahito, Dominique Orban. The Conjugate Residual Method in Linesearch and Trust-Region Methods
2026 -- 2052Meixia Lin, Yong-Jin Liu, Defeng Sun, Kim-Chuan Toh. Efficient Sparse Semismooth Newton Methods for the Clustered Lasso Problem
2053 -- 2078Mila Nikolova, Pauline Tan. Alternating Structure-Adapted Proximal Gradient Descent for Nonconvex Nonsmooth Block-Regularized Problems
2079 -- 2099Caroline Geiersbach, Georg Ch. Pflug. Projected Stochastic Gradients for Convex Constrained Problems in Hilbert Spaces
2100 -- 2127Immanuel M. Bomze, Panayotis Mertikopoulos, Werner Schachinger, Mathias Staudigl. Hessian Barrier Algorithms for Linearly Constrained Optimization Problems
2128 -- 2145Jean-Bernard Lasserre, Victor Magron. In SDP Relaxations, Inaccurate Solvers Do Robust Optimization
2146 -- 2178Yair Carmon, John C. Duchi. Gradient Descent Finds the Cubic-Regularized Nonconvex Newton Step
2179 -- 2210Wim van Ackooij, Pedro Pérez-Aros. Generalized Differentiation of Probability Functions Acting on an Infinite System of Constraints
2211 -- 2226Immanuel M. Bomze, Francesco Rinaldi, Samuel Rota Bulò. First-order Methods for the Impatient: Support Identification in Finite Time with Convergent Frank-Wolfe Variants
2227 -- 2256Hédy Attouch, Zaki Chbani, Hassan Riahi. Fast Proximal Methods via Time Scaling of Damped Inertial Dynamics
2257 -- 2290Hilal Asi, John C. Duchi. Stochastic (Approximate) Proximal Point Methods: Convergence, Optimality, and Adaptivity
2291 -- 2319Zongshan Shen, Jen-Chih Yao, Xi Yin Zheng. Calmness and the Abadie CQ for Multifunctions and Linear Regularity for a Collection of Closed Sets
2320 -- 2336Burak Kocuk, Diego A. Morán R.. On Subadditive Duality for Conic Mixed-integer Programs
2337 -- 2362Zhengling Qi, Ying Cui 0004, Yufeng Liu, Jong-Shi Pang. Estimation of Individualized Decision Rules Based on an Optimized Covariate-Dependent Equivalent of Random Outcomes
2363 -- 2387Vera Roshchina, Levent Tunçel. Facially Dual Complete (Nice) Cones and Lexicographic Tangents
2388 -- 2421Jinhua Wang, Yaohua Hu, Carisa Kwok Wai Yu, Chong Li, Xiaoqi Yang. Extended Newton Methods for Multiobjective Optimization: Majorizing Function Technique and Convergence Analysis

Volume 29, Issue 2

965 -- 993Albert S. Berahas, Richard H. Byrd, Jorge Nocedal. Derivative-Free Optimization of Noisy Functions via Quasi-Newton Methods
994 -- 1016Aram V. Arutyunov, Sergey E. Zhukovskiy. Variational Principles in Analysis and Existence of Minimizers for Functions on Metric Spaces
1017 -- 1047Jana Thomann, Gabriele Eichfelder. A Trust-Region Algorithm for Heterogeneous Multiobjective Optimization
1048 -- 1075Cosmin G. Petra, Naiyuan Chiang, Mihai Anitescu. A Structured Quasi-Newton Algorithm for Optimizing with Incomplete Hessian Information
1076 -- 1105Pierre Bonami, Andrea Lodi 0001, Jonas Schweiger, Andrea Tramontani. Solving Quadratic Programming by Cutting Planes
1106 -- 1130Rafael Correa, Abderrahim Hantoute, Marco Antonio López Cerdá. Moreau-Rockafellar-Type Formulas for the Subdifferential of the Supremum Function
1131 -- 1163Nir Halman, Giacomo Nannicini. Toward Breaking the Curse of Dimensionality: An FPTAS for Stochastic Dynamic Programs with Multidimensional Actions and Scalar States
1164 -- 1189Charles Audet, Sébastien Le Digabel, Christophe Tribes. The Mesh Adaptive Direct Search Algorithm for Granular and Discrete Variables
1190 -- 1210Amitabh Basu, Sriram Sankaranarayanan. Can Cut-Generating Functions Be Good and Efficient?
1211 -- 1239Napat Rujeerapaiboon, Kilian Schindler, Daniel Kuhn, Wolfram Wiesemann. Size Matters: Cardinality-Constrained Clustering and Outlier Detection via Conic Optimization
1240 -- 1259Luze Xu, Jon Lee 0001, Daphne Skipper. More Virtuous Smoothing
1260 -- 1281Claire Boyer, Antonin Chambolle, Yohann de Castro, Vincent Duval, Frédéric de Gournay, Pierre Weiss. On Representer Theorems and Convex Regularization
1282 -- 1299Paul T. Boggs, Richard H. Byrd. Adaptive, Limited-Memory BFGS Algorithms for Unconstrained Optimization
1300 -- 1328Radu Ioan Bot, Ernö Robert Csetnek, Dang Khoa Nguyen. A Proximal Minimization Algorithm for Structured Nonconvex and Nonsmooth Problems
1329 -- 1349Armin Eftekhari, Andrew Thompson 0001. Sparse Inverse Problems over Measures: Equivalence of the Conditional Gradient and Exchange Methods
1350 -- 1365Benjamin Grimmer. Convergence Rates for Deterministic and Stochastic Subgradient Methods without Lipschitz Continuity
1366 -- 1391Michael P. Friedlander, Ives Macêdo, Ting Kei Pong. Polar Convolution
1392 -- 1407Yashan Xu. Saddle Points of Obstacles for an Elliptic Variational Inequality
1408 -- 1443Hongzhou Lin, Julien Mairal, Zaïd Harchaoui. An Inexact Variable Metric Proximal Point Algorithm for Generic Quasi-Newton Acceleration
1444 -- 1472Hiroyuki Sato, Hiroyuki Kasai, Bamdev Mishra. Riemannian Stochastic Variance Reduced Gradient Algorithm with Retraction and Vector Transport
1473 -- 1501Andrea Walther, Andreas Griewank. Characterizing and Testing Subdifferential Regularity in Piecewise Smooth Optimization
1502 -- 1523Phan Quoc Khanh, Nguyen Hong Quan. Versions of the Weierstrass Theorem for Bifunctions and Solution Existence in Optimization
1524 -- 1557Boris S. Mordukhovich, M. Ebrahim Sarabi. Criticality of Lagrange Multipliers in Variational Systems
1558 -- 1577Didier Aussel, K. Cao Van, David Salas. Quasi-Variational Inequality Problems over Product Sets with Quasi-monotone Operators
1578 -- 1602Karima Boufi, Ahmed Roubi. Duality Results and Dual Bundle Methods Based on the Dual Method of Centers for Minimax Fractional Programs
1603 -- 1633Rujun Jiang, Duan Li 0002. Novel Reformulations and Efficient Algorithms for the Generalized Trust Region Subproblem
1634 -- 1656Lorenzo Lampariello, Simone Sagratella, Oliver Stein. The Standard Pessimistic Bilevel Problem
1657 -- 1686Weiwei Xu, Wen Li, Lei Zhu, Xueping Huang. The Analytic Solutions of a Class of Constrained Matrix Minimization and Maximization Problems with Applications
1687 -- 1713Ali Ridha Mahjoub, Michael Poss, Luidi Simonetti, Eduardo Uchoa. Distance Transformation for Network Design Problems
1714 -- 1743Pedro Pérez-Aros. Subdifferential Formulae for the Supremum of an Arbitrary Family of Functions

Volume 29, Issue 1

1 -- 30Daniel Blado, Alejandro Toriello. Relaxation Analysis for the Dynamic Knapsack Problem with Stochastic Item Sizes
31 -- 54Luis Felipe Bueno, Gabriel Haeser, Frank Navarro Rojas. Optimality Conditions and Constraint Qualifications for Generalized Nash Equilibrium Problems and Their Practical Implications
55 -- 76Merve Bodur, Alberto Del Pia, Santanu S. Dey, Marco S. Molinaro. Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs
77 -- 99Geovani Nunes Grapiglia, Yurii Nesterov. Accelerated Regularized Newton Methods for Minimizing Composite Convex Functions
100 -- 134Olivier Fercoq, Pascal Bianchi. A Coordinate-Descent Primal-Dual Algorithm with Large Step Size and Possibly Nonseparable Functions
135 -- 161Xiaojun Chen 0001, Alexander Shapiro, Hailin Sun. Convergence Analysis of Sample Average Approximation of Two-Stage Stochastic Generalized Equations
162 -- 174David H. Gutman, Javier F. Pena. Convergence Rates of Proximal Gradient Methods via the Convex Conjugate
175 -- 206Alfredo N. Iusem, Alejandro Jofré, Roberto I. Oliveira, Philip Thompson. Variance-Based Extragradient Methods with Line Search for Stochastic Variational Inequalities
207 -- 239Damek Davis, Dmitriy Drusvyatskiy. Stochastic Model-Based Minimization of Weakly Convex Functions
240 -- 261Xujin Chen, Wenan Zang, Qiulan Zhao. Densities, Matchings, and Fractional Edge-Colorings
262 -- 289Andreas Griewank, Andrea Walther. Relaxing Kink Qualifications and Proving Convergence Rates in Piecewise Smooth Optimization
290 -- 317Christian Hess, Raffaello Seri. Generic Consistency for Approximate Stochastic Programming and Statistical Problems
318 -- 342Kibaek Kim, Cosmin G. Petra, Victor M. Zavala. An Asynchronous Bundle-Trust-Region Method for Dual Decomposition of Stochastic Mixed-Integer Programming
343 -- 368Santiago Paternain, Aryan Mokhtari, Alejandro Ribeiro. A Newton-Based Method for Nonconvex Optimization with Fast Evasion of Saddle Points
369 -- 398Daniel Rehfeldt, Thorsten Koch. Combining NP-Hard Reduction Techniques and Strong Heuristics in an Exact Algorithm for the Maximum-Weight Connected Subgraph Problem
399 -- 422Amir Ali Ahmadi, Etienne de Klerk, Georgina Hall. Polynomial Norms
423 -- 453Helmut Gfrerer, Boris S. Mordukhovich. Second-Order Variational Analysis of Parametric Constraint and Variational Systems
454 -- 483Francesca Maggioni, Georg Ch. Pflug. Guaranteed Bounds for General Nondiscrete Multistage Risk-Averse Stochastic Optimization Programs
484 -- 510C. H. Jeffrey Pang. Distributed Deterministic Asynchronous Algorithms in Time-Varying Graphs Through Dykstra Splitting
511 -- 521Aris Daniilidis, Gonzalo Flores. Linear Structure of Functions with Maximal Clarke Subdifferential
522 -- 540Jean-Paul Penot. Error Bounds and Multipliers in Constrained Optimization Problems with Tolerance
541 -- 570Peter Ochs. Unifying Abstract Inexact Convergence Theorems and Block Coordinate Variable Metric iPiano
571 -- 594Liqiang Song, Wei Hong Yang. A Block Lanczos Method for the Extended Trust-Region Subproblem
595 -- 615Coralia Cartis, Nick I. M. Gould, Philippe L. Toint. Universal Regularization Methods: Varying the Power, the Smoothness and the Accuracy
616 -- 659Shuoguang Yang, Mengdi Wang, Ethan X. Fang. Multilevel Stochastic Gradient Methods for Nested Composition Optimization
660 -- 689Jelena Diakonikolas, Lorenzo Orecchia. The Approximate Duality Gap Technique: A Unified Theory of First-Order Methods
690 -- 718Hao-Hsiang Wu, Simge Küçükyavuz. Probabilistic Partial Set Covering with an Oracle for Chance Constraints
719 -- 742Cheng Lu, Ya-Feng Liu, Wei-Qiang Zhang, Shuzhong Zhang. Tightness of a New and Enhanced Semidefinite Relaxation for MIMO Detection
743 -- 766Roberto Andreani, Nadia S. Fazzio, María Laura Schuverdt, Leonardo D. Secchin. A Sequential Optimality Condition Related to the Quasi-normality Constraint Qualification and Its Algorithmic Consequences
767 -- 793C. Kanzow, Veronika Karl, Daniel Steck, Daniel Wachsmuth. The Multiplier-Penalty Method for Generalized Nash Equilibrium Problems in Banach Spaces
794 -- 821Julia Niebling, Gabriele Eichfelder. A Branch-and-Bound-Based Algorithm for Nonconvex Multiobjective Optimization
822 -- 851Dávid Papp, Sercan Yildiz. Sum-of-Squares Optimization without Semidefinite Programming
852 -- 873Alperen A. Ergür. Approximating Nonnegative Polynomials via Spectral Sparsification
874 -- 903Xiaojun Chen 0001, Philippe L. Toint, H. Wang. Complexity of Partially Separable Convexly Constrained Optimization with Non-Lipschitzian Singularities
904 -- 932Man-Chung Yue, Zirui Zhou, Anthony Man-Cho So. On the Quadratic Convergence of the Cubic Regularization Method under a Local Error Bound Condition
933 -- 963Christian Clason, Stanislav Mazurenko, Tuomo Valkonen. Acceleration and Global Convergence of a First-Order Primal-Dual Method for Nonconvex Problems