


default search action
SIAM Journal on Optimization, Volume 33
Volume 33, Number 1, March 2023
- Qihang Lin

, Yangyang Xu:
Reducing the Complexity of Two Classes of Optimization Problems by Inexact Accelerated Proximal Gradient Method. 1-35 - Xiaoyan Han

, Adrian S. Lewis
:
Survey Descent: A Multipoint Generalization of Gradient Descent for Nonsmooth Optimization. 36-62 - Victor Magron

, Mohab Safey El Din, Trung Hieu Vu
:
Sum of Squares Decompositions of Polynomials over their Gradient Ideals with Rational Coefficients. 63-88 - Felipe Atenas

, Claudia A. Sagastizábal
, Paulo J. S. Silva
, Mikhail V. Solodov:
A Unified Analysis of Descent Sequences in Weakly Convex Optimization, Including Convergence Rates for Bundle Methods. 89-115 - Çagin Ararat

, Simay Tekgül, Firdevs Ulus
:
Geometric Duality Results and Approximation Algorithms for Convex Vector Optimization Problems. 116-146 - Mingyi Hong, Hoi-To Wai

, Zhaoran Wang, Zhuoran Yang:
A Two-Timescale Stochastic Algorithm Framework for Bilevel Optimization: Complexity Analysis and Application to Actor-Critic. 147-180 - Weiwei Kong

, Jefferson G. Melo
, Renato D. C. Monteiro:
Iteration Complexity of an Inner Accelerated Inexact Proximal Augmented Lagrangian Method Based on the Classical Lagrangian Function. 181-210 - Giacomo Borghi

, Michael Herty
, Lorenzo Pareschi
:
Constrained Consensus-Based Optimization. 211-236 - Harbir Antil

, Drew P. Kouri
, Denis Ridzal:
ALESQP: An Augmented Lagrangian Equality-Constrained SQP Method for Optimization with General Constraints. 237-266 - Mengmeng Song, Hongying Liu, Jiulin Wang

, Yong Xia:
On Local Minimizers of Nonconvex Homogeneous Quadratically Constrained Quadratic Optimization with at Most Two Constraints. 267-293 - Forrest Laine

, David Fridovich-Keil, Chih-Yuan Chiu, Claire J. Tomlin:
The Computation of Approximate Generalized Feedback Nash Equilibria. 294-318 - Najmeh Hoseini Monjezi:

A Bundle Trust Region Algorithm for Minimizing Locally Lipschitz Functions. 319-337 - Xi Yin Zheng:

Convex Optimization Problems on Differentiable Sets. 338-359
Volume 33, Number 2, June 2023
- Radu Ioan Bot

, Minh N. Dao
, Guoyin Li
:
Inertial Proximal Block Coordinate Method for a Class of Nonsmooth Sum-of-Ratios Optimization Problems. 361-393 - Dusan Jakovetic, Dragana Bajovic, Anit Kumar Sahu, Soummya Kar

, Nemanja Milosevic, Dusan Stamenkovic:
Nonlinear Gradient Mappings and Stochastic Optimization: A General Framework with Applications to Heavy-Tail Noise. 394-423 - Mateo Díaz, Benjamin Grimmer

:
Optimal Convergence Rates for the Proximal Bundle Method. 424-454 - Simone Garatti, Marco C. Campi:

On Conditional Risk Assessments in Scenario Optimization. 455-480 - Alexander Chernyavsky

, Jason J. Bramburger
, Giovanni Fantuzzi
, David Goluskin
:
Convex Relaxations of Integral Variational Problems: Pointwise Dual Relaxation and Sum-of-Squares Optimization. 481-512 - Felix Kirschner

, Etienne de Klerk
:
Construction of Multivariate Polynomial Approximation Kernels via Semidefinite Programming. 513-537 - Christoph Hunkenschröder

, Sebastian Pokutta, Robert Weismantel:
Minimizing a Low-Dimensional Convex Function Over a High-Dimensional Cube. 538-552 - Eliza O'Reilly, Venkat Chandrasekaran:

Spectrahedral Regression. 553-588 - Bahar Taskesen

, Soroosh Shafieezadeh-Abadeh
, Daniel Kuhn, Karthik Natarajan:
Discrete Optimal Transport with Independent Marginals is #P-Hard. 589-614 - Darinka Dentcheva, Andrzej Ruszczynski

:
Mini-Batch Risk Forms. 615-637 - Yitian Qian, Shaohua Pan:

Convergence of a Class of Nonmonotone Descent Methods for Kurdyka-Łojasiewicz Optimization Problems. 638-651 - Xinwei Zhang, Mingyi Hong, Nicola Elia:

Understanding a Class of Decentralized and Federated Optimization Algorithms: A Multirate Feedback Control Perspective. 652-683 - Peng Wang

, Huikang Liu, Anthony Man-Cho So
:
Linear Convergence of a Proximal Alternating Minimization Method with Extrapolation for \(\boldsymbol{\ell_1}\) -Norm Principal Component Analysis. 684-712 - Ziang Chen

, Yingzhou Li, Jianfeng Lu
:
On the Global Convergence of Randomized Coordinate Gradient Descent for Nonconvex Optimization. 713-738 - Heinz H. Bauschke, Shambhavi Singh

, Xianfu Wang
:
The Splitting Algorithms by Ryu, by Malitsky-Tam, and by Campoy Applied to Normal Cones of Linear Subspaces Converge Strongly to the Projection onto the Intersection. 739-765 - Duong Thi Viet An

, Hong-Kun Xu
, Nguyen Dong Yen:
Fréchet Second-Order Subdifferentials of Lagrangian Functions and Optimality Conditions. 766-784 - Bruno Dinis

, Pedro Pinto
:
Strong Convergence for the Alternating Halpern-Mann Iteration in CAT(0) Spaces. 785-815 - Mingjie Gao, Ka-Fai Cedric Yiu:

Moderate Deviations and Invariance Principles for Sample Average Approximations. 816-841 - Xavier Dupuis, Samuel Vaiter

:
The Geometry of Sparse Analysis Regularization. 842-867 - Luca Consolini, Marco Locatelli

:
Sharp and Fast Bounds for the Celis-Dennis-Tapia Problem. 868-898 - Jong-Shi Pang, Shaoning Han

:
Some Strongly Polynomially Solvable Convex Quadratic Programs with Bounded Variables. 899-920 - Yongfeng Li, Mingming Zhao, Weijie Chen

, Zaiwen Wen:
A Stochastic Composite Augmented Lagrangian Method for Reinforcement Learning. 921-949 - Harald Günzel, Daniel Hernández Escobar

, Jan-J. Rückmann:
Strongly Stable Stationary Points for a Class of Generalized Equations. 950-977 - Hadi Reisizadeh, Behrouz Touri

, Soheil Mohajer
:
DIMIX: Diminishing Mixing for Sloppy Agents. 978-1005 - Frank Permenter:

A Geodesic Interior-Point Method for Linear Optimization over Symmetric Cones. 1006-1034 - Junyu Zhang

, Mengdi Wang
, Mingyi Hong, Shuzhong Zhang
:
Primal-Dual First-Order Methods for Affinely Constrained Multi-block Saddle Point Problems. 1035-1060 - Wenhao Zhan, Shicong Cen, Baihe Huang, Yuxin Chen

, Jason D. Lee, Yuejie Chi
:
Policy Mirror Descent for Regularized Reinforcement Learning: A Generalized Framework with Linear Convergence. 1061-1091 - Xiao Li, Andre Milzarek

, Junwen Qiu:
Convergence of Random Reshuffling under the Kurdyka-Łojasiewicz Inequality. 1092-1120 - Pham Duy Khanh, Boris S. Mordukhovich, Vo Thanh Phat

:
Variational Convexity of Functions and Variational Sufficiency in Optimization. 1121-1158 - Zhaosong Lu, Zirui Zhou:

Iteration-Complexity of First-Order Augmented Lagrangian Methods for Convex Conic Programming. 1159-1190 - Chuan He

, Zhaosong Lu:
A Newton-CG Based Barrier Method for Finding a Second-Order Stationary Point of Nonconvex Conic Optimization with Complexity Guarantees. 1191-1222 - Tobias Harks

, Julian Schwarz
:
A Unified Framework for Pricing in Nonconvex Resource Allocation Games. 1223-1249 - Alex L. Wang

, Yunlei Lu, Fatma Kilinç-Karzan
:
Implicit Regularity and Linear Convergence Rates for the Generalized Trust-Region Subproblem. 1250-1278 - Alexander Shapiro

, Enlu Zhou
, Yifan Lin
:
Bayesian Distributionally Robust Optimization. 1279-1304 - Lijun Ding, Benjamin Grimmer

:
Revisiting Spectral Bundle Methods: Primal-Dual (Sub)linear Convergence Rates. 1305-1332
Volume 33, Number 3, September 2023
- Xinrong Li, Ziyan Luo:

Normal Cones Intersection Rule and Optimality Analysis for Low-Rank Matrix Optimization with Affine Manifolds. 1333-1360 - Yifei Wang

, Kangkang Deng
, Haoyang Liu, Zaiwen Wen:
A Decomposition Augmented Lagrangian Method for Low-Rank Semidefinite Programming. 1361-1390 - Archis Ghate:

Dual Ascent and Primal-Dual Algorithms for Infinite-Horizon Nonstationary Markov Decision Processes. 1391-1415 - Cédric Josz

, Xiaopeng Li
:
Certifying the Absence of Spurious Local Minima at Infinity. 1416-1439 - Konstantin Mishchenko:

Regularized Newton Method with Global \({\boldsymbol{\mathcal{O}(1/{k}^2)}}\) Convergence. 1440-1462 - Amir Beck, Israel Rosset:

A Dynamic Smoothing Technique for a Class of Nonsmooth Optimization Problems on Manifolds. 1473-1493 - Edouard Pauwels

, Samuel Vaiter
:
The Derivatives of Sinkhorn-Knopp Converge. 1494-1517 - Guanghui Lan, Zhe Zhang:

Optimal Methods for Convex Risk-Averse Distributed Optimization. 1518-1557 - Céline Moucer, Adrien B. Taylor, Francis R. Bach:

A Systematic Approach to Lyapunov Analyses of Continuous-Time Models in Convex Optimization. 1558-1586 - Jiawang Nie, Xindong Tang

, Suhan Zhong
:
Rational Generalized Nash Equilibrium Problems. 1587-1620 - Serge Gratton

, Sadok Jerad
, Philippe L. Toint
:
Convergence Properties of an Objective-Function-Free Optimization Regularization Algorithm, Including an \(\boldsymbol{\mathcal{O}(\epsilon^{-3/2})}\) Complexity Bound. 1621-1646 - Guanghui Lan, Yuyuan Ouyang

, Yi Zhou
:
Graph Topology Invariant Gradient and Sampling Complexity for Decentralized and Stochastic Optimization. 1647-1675 - Yuqia Wu

, Shaohua Pan, Xiaoqi Yang
:
A Regularized Newton Method for \({\boldsymbol{\ell}}_{q}\) -Norm Composite Optimization Problems. 1676-1706 - Sebastian Blauth

:
Space Mapping for PDE Constrained Shape Optimization. 1707-1733 - Chuan He

, Zhaosong Lu, Ting Kei Pong:
A Newton-CG Based Augmented Lagrangian Method for Finding a Second-Order Stationary Point of Nonconvex Equality Constrained Optimization with Complexity Guarantees. 1734-1766 - Juan Pablo Luna

, Claudia A. Sagastizábal
, Julia Filiberti Allen, Steven A. Gabriel, Mikhail V. Solodov:
Regularized Equilibrium Problems with Equilibrium Constraints with Application to Energy Markets. 1767-1796 - Andi Han

, Bamdev Mishra, Pratik Jawanpuria, Pawan Kumar, Junbin Gao
:
Riemannian Hamiltonian Methods for Min-Max Optimization on Manifolds. 1797-1827 - Peng Chen, Johannes O. Royset:

Performance Bounds for PDE-Constrained Optimization under Uncertainty. 1828-1854 - Geovani Nunes Grapiglia

, Yurii E. Nesterov:
Adaptive Third-Order Methods for Composite Convex Optimization. 1855-1883 - Radu Ioan Bot

, Axel Böhm
:
Alternating Proximal-Gradient Steps for (Stochastic) Nonconvex-Concave Minimax Problems. 1884-1913 - Francesco Caruso, Maria Carmela Ceparano, Jacqueline Morgan

:
Affine Relaxations of the Best Response Algorithm: Global Convergence in Ratio-Bounded Games. 1914-1942 - Killian Wood

, Emiliano Dall'Anese:
Stochastic Saddle Point Problems with Decision-Dependent Distributions. 1943-1967 - Prateek Jaiswal, Harsha Honnappa

, Vinayak A. Rao:
Bayesian Joint Chance Constrained Optimization: Approximations and Statistical Consistency. 1968-1995 - Jinhua Wang, Chong Li, K. F. Ng:

Convergence Rate of Inexact Proximal Point Algorithms for Operator with Hölder Metric Subregularity. 1996-2020 - Wenfang Yao, Xiaoqi Yang

:
Relative Lipschitz-like Property of Parametric Systems via Projectional Coderivatives. 2021-2040 - Benoît Legat, Chenyang Yuan

, Pablo A. Parrilo
:
Low-Rank Univariate Sum of Squares Has No Spurious Local Minima. 2041-2061 - Simai He, Haodong Hu, Bo Jiang

, Zhening Li
:
Approximating Tensor Norms via Sphere Covering: Bridging the Gap between Primal and Dual. 2062-2088 - Fatih S. Aktas, Mustafa Ç. Pinar

:
PCA Sparsified. 2089-2117 - Guillaume Carlier

:
Fenchel-Young Inequality with a Remainder and Applications to Convex Duality and Optimal Transport. 1463-1472 - Figen Öztoprak, Richard H. Byrd, Jorge Nocedal:

Constrained Optimization in the Presence of Noise. 2118-2136 - Francis R. Bach, Alessandro Rudi:

Exponential Convergence of Sum-of-Squares Hierarchies for Trigonometric Polynomials. 2137-2159 - Flávia Chorobura, Ion Necoara:

Random Coordinate Descent Methods for Nonseparable Composite Optimization. 2160-2190 - Frank E. Curtis

, Qi Wang
:
Worst-Case Complexity of TRACE with Inexact Subproblem Solutions for Nonconvex Smooth Optimization. 2191-2221 - Gilles Bareilles

, Franck Iutzeler
, Jérôme Malick
:
Harnessing Structure in Composite Nonsmooth Minimization. 2222-2247 - Hamed Rahimian

, Bernardo K. Pagnoncelli:
Data-Driven Approximation of Contextual Chance-Constrained Stochastic Programs. 2248-2274 - Zhaosong Lu, Sanyou Mei:

Accelerated First-Order Methods for Convex Optimization with Locally Lipschitz Continuous Gradient. 2275-2310 - David Salas, Anton Svensson:

Existence of Solutions for Deterministic Bilevel Games under a General Bayesian Approach. 2311-2340 - Guanghui Lan, Yan Li

, Tuo Zhao:
Block Policy Mirror Descent. 2341-2378 - Jingyi Wang, Cosmin G. Petra

:
A Sequential Quadratic Programming Algorithm for Nonsmooth Problems with Upper- \({\boldsymbol{\mathcal{C}^2}}\) Objective. 2379-2405 - Hongfan (Kevin) Chen, Xu Andy Sun, Haoxiang Yang

:
Robust Optimization with Continuous Decision-Dependent Uncertainty with applications to demand response management. 2406-2434 - Jourdain B. Lamperski

, Oleg A. Prokopyev
, Luca G. Wrabetz
:
Min-Max-Min Optimization with Smooth and Strongly Convex Objectives. 2435-2456 - Van Huynh Ngai, Jean-Paul Penot

:
The Semiconvex Regularization of Functions. 2457-2483 - Xi Yin Zheng:

Corrigendum: Convex Optimization Problems on Differentiable Sets. 2484-2488
Volume 33, Number 4, December 2023
- Tongseok Lim

:
Maximal Monotonicity and Cyclic Involutivity of Multiconjugate Convex Functions. 2489-2511 - Samir Adly, Loïc Bourdin

, Fabien Caubet
, Aymeric Jacob de Cordemoy
:
Shape Optimization for Variational Inequalities: The Scalar Tresca Friction Problem. 2512-2541 - Jérôme Bolte, Tam Le, Edouard Pauwels

:
Subgradient Sampling for Nonsmooth Nonconvex Minimization. 2542-2569 - Leon Liu, Walaa M. Moursi, Jon Vanderwerff:

Strongly Nonexpansive Mappings Revisited: Uniform Monotonicity and Operator Splitting. 2570-2597 - Andrea Wagner

, Firdevs Ulus
, Birgit Rudloff
, Gabriela Kovácová
, Niklas Hey:
Algorithms to Solve Unbounded Convex Vector Optimization Problems. 2598-2624 - Matús Benko

, Helmut Gfrerer
, Jane J. Ye, Jin Zhang
, Jinchuan Zhou:
Second-Order Optimality Conditions for General Nonconvex Optimization Problems and Variational Analysis of Disjunctive Systems. 2625-2653 - Javier Peña

:
Affine Invariant Convergence Rates of the Conditional Gradient Method. 2654-2674 - Ioannis C. Tsaknakis, Mingyi Hong, Shuzhong Zhang

:
Minimax Problems with Coupled Linear Constraints: Computational Complexity and Duality. 2675-2702 - Minh N. Dao

, Hassan Saoud
, Michel A. Théra
:
Locating Theorems of Differential Inclusions Governed by Maximally Monotone Operators. 2703-2720 - Emanuel Laude

, Andreas Themelis
, Panagiotis Patrinos
:
Dualities for Non-Euclidean Smoothness and Strong Convexity under the Light of Generalized Conjugacy. 2721-2749 - Ryan Hynd:

Evolution of Mixed Strategies in Monotone Games. 2750-2771 - Serge Gratton, Alena Kopanicáková

, Philippe L. Toint
:
Multilevel Objective-Function-Free Optimization with an Application to Neural Networks Training. 2772-2800 - Xiaoyin Hu

, Nachuan Xiao, Xin Liu
, Kim-Chuan Toh
:
An Improved Unconstrained Approach for Bilevel Optimization. 2801-2829 - Olga Kuryatnikova

, Bissan Ghaddar
, Daniel K. Molzahn
:
Two-Stage Robust Quadratic Optimization with Equalities and Its Application to Optimal Power Flow. 2830-2857 - Hamza Fawzi, James Saunderson

:
Optimal Self-Concordant Barriers for Quantum Relative Entropies. 2858-2884 - Peiyuan Zhang, Jingzhao Zhang, Suvrit Sra:

Sion's Minimax Theorem in Geodesic Metric Spaces and a Riemannian Extragradient Algorithm. 2885-2908 - Andreas Bärmann, Alexander Martin, Oskar Schneider:

The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints. 2909-2934 - Chaobing Song

, Jelena Diakonikolas
:
Cyclic Coordinate Dual Averaging with Extrapolation. 2935-2961 - Yuyuan Ouyang

, Trevor Squires:
Universal Conditional Gradient Sliding for Convex Optimization. 2962-2987 - Shiwei Wang, Chao Ding, Yangjing Zhang

, Xinyuan Zhao
:
Strong Variational Sufficiency for Nonlinear Semidefinite Programming and Its Implications. 2988-3011 - Cédric Josz

, Lexiao Lai
, Xiaopeng Li
:
Convergence of the Momentum Method for Semialgebraic Functions with Locally Lipschitz Gradients. 3012-3037 - Xiaoxi Jia, Christian Kanzow

, Patrick Mehlitz
:
Convergence Analysis of the Proximal Gradient Method in the Presence of the Kurdyka-Łojasiewicz Property Without Global Lipschitz Assumptions. 3038-3056 - Lindon Roberts

, Clément W. Royer
:
Direct Search Based on Probabilistic Descent in Reduced Spaces. 3057-3082 - J. Frédéric Bonnans, Kang Liu

, Nadia Oudjane, Laurent Pfeiffer
, Cheng Wan:
Large-Scale Nonconvex Optimization: Randomization, Gap Estimation, and Numerical Resolution. 3083-3113 - Roey Merchav

, Shoham Sabach:
Convex Bi-level Optimization Problems with Nonsmooth Outer Objective Function. 3114-3142

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














