default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSIAM Journal on Optimization, Volume 36
Volume 36, Number 1, 2026
- Zhaosong Lu, Sanyou Mei, Yifeng Xiao:
Variance-Reduced First-Order Methods for Deterministically Constrained Stochastic Nonconvex Optimization with Strong Convergence Guarantees. 1-31 - Aleksandar Armacki
, Shuhua Yu, Dragana Bajovic, Dusan Jakovetic, Soummya Kar:
Large Deviation Upper Bounds and Improved MSE Rates of Nonlinear SGD: Heavy-Tailed Noise and Power of Symmetry. 32-59 - Anderson Ye Zhang:
Tightness of SDP and Burer-Monteiro Factorization for Phase Synchronization in a High-Noise Regime. 60-89 - Tianyun Tang, Kim-Chuan Toh:
Exploring Chordal Sparsity in Semidefinite Programming with Sparse plus Low-Rank Data Matrices. 90-119 - Mengmeng Li, Daniel Kuhn, Tobias Sutter:
Policy Gradient Algorithms for Robust MDP\(\text{s}\) with Nonrectangular Uncertainty Sets. 120-151 - Jelena Diakonikolas, Cristóbal Guzmán:
Optimization on a Finer Scale: Bounded Local Subgradient Variation Perspective. 152-184 - Marianna Eisenberg-Nagy, Tibor Illés, Yurii Nesterov, Petra Renáta Rigó:
New Interior-Point Algorithm for Linear Optimization Based on a Universal Tangent Direction. 185-203 - Alexander Taveira Blomenhofer, Monique Laurent:
Moment-Sos and Spectral Hierarchies for Polynomial Optimization on the Sphere and Quantum de Finetti Theorems. 204-232 - Tomás González, Cristóbal Guzmán, Courtney Paquette:
Mirror Descent Algorithms with Nearly Dimension-Independent Rates for Differentially-Private Stochastic Saddle-Point Problems. 233-262 - Richard Heusdens, Guoqiang Zhang:
Distributed Nonlinear Conic Optimization with Partially Separable Structure. 263-289 - Yassine Nabou, Ion Necoara:
Moving Higher-Order Taylor Approximations Method for Smooth Constrained Minimization Problems. 290-319 - Simon Ruetz, Karin Schnass:
Convergence Regions of Alternating Minimization Algorithms for Dictionary Learning. 320-349 - Xiaoning Bai, Shangzhi Zeng, Jin Zhang, Lezhi Zhang:
Alternating Gradient-Type Algorithm for Bilevel Optimization with Inexact Lower-Level Solutions via Moreau Envelope-Based Reformulation. 350-380 - Huu-Quang Nguyen, Ting-Tsen Lin, Ruey-Lin Sheu, Yong Xia:
A QP1QC Approach for Deciding Whether or Not Two Quadratic Surfaces Intersect. 381-408 - César Gutiérrez, E. Hernández:
Efficient Solutions in Uncertain Multiobjective Optimization with Countably Many Scenarios. 409-433 - Dhruv Kohli, Gal Mishne, Alexander Cloninger:
Non-degenerate Rigid Alignment in a Patch Framework. 434-465 - Roberto Andreani, Kelvin R. Couto, Orizon P. Ferreira, Gabriel Haeser, Leandro da Fonseca Prudente:
Global Convergence of an Augmented Lagrangian Method for Nonlinear Programming via Riemannian Optimization. 466-501
Volume 36, Number 2, 2026
- Jared Miller, Jie Wang, Feng Guo:
Sparse Polynomial Matrix Optimization. 503-533 - Youssef Diouane, Mohamed Laghdaf Habiboullah, Dominique Orban:
A Proximal Modified Quasi-Newton Method for Nonsmooth Regularized Optimization. 534-563 - Luke Marrinan, Uday V. Shanbhag, Farzad Yousefian:
Zeroth-Order Gradient and Quasi-Newton Methods for Nonsmooth Nonconvex Stochastic Optimization. 564-596 - Matteo Lapucci, Pierluigi Mansueto, Davide Pucci:
Effective Front-Descent Algorithms with Convergence Guarantees. 597-625 - Youssef Diouane, Maxence Gollier, Dominique Orban:
Nonsmooth Exact Penalty Methods for Equality-Constrained Optimization: Complexity and Implementation. 626-650 - Harbir Antil, Sean P. Carney, Hugo Díaz, Johannes O. Royset:
Rockafellian Relaxation for PDE-Constrained Optimization with Distributional Ambiguity. 651-677 - Marc Dambrine, Caroline Geiersbach, Helmut Harbrecht:
Two-Norm Discrepancy and Convergence of the Stochastic Gradient Method with Application to Shape Optimization. 678-702 - Shuhua Yu, Dusan Jakovetic, Soummya Kar:
Smoothed Gradient Clipping and Error Feedback for Decentralized Optimization under Symmetric Heavy-Tailed Noise. 703-728 - Hoang Anh Tran, Binh Tuan Nguyen, Yong Sheng Soh:
Sum-of-Squares Hierarchy for the Gromov-Wasserstein Problem. 729-759 - Hoang Anh Tran, Kim-Chuan Toh:
Convergence Rates of Sum-of-Squares Hierarchies for Polynomial Semidefinite Programs. 760-790 - Qiang Du, Kaizheng Wang, Edith Zhang, Chenyang Zhong:
A Particle Algorithm for Mean-Field Variational Inference. 791-810 - Xiaoyin Hu, Kim-Chuan Toh, Shiwei Wang, Nachuan Xiao:
A Minimization Approach for Minimax Optimization with Coupled Constraints. 811-840 - Paul Manns:
Convergence of Trust-Region Algorithms in Metric Spaces. 841-865 - Javier Peña, Juan C. Vera, Luis F. Zuluaga:
Duality of Hoffman Constants. 866-886 - Zsolt Darvay, Marianna E.-Nagy, Goran Lesaja, Petra Renáta Rigó, Anita Varga:
Comprehensive Analysis of Kernel-Based Interior-Point Methods for the \({P}_{{*}}{(\kappa )}\)-LCP. 887-911 - Stephan Eckstein, Aziz Lakhal:
Exponential Convergence of General Iterative Proportional Fitting Procedures. 912-937 - Luwei Bai, Yaohua Hu, Hao Wang, Xiaoqi Yang:
Avoiding Strict Saddle Points of Nonconvex Regularized Problems. 938-967
Volume 36, Number 3, 2026
- Yuchen Lou, Xinyi Luo, Andreas Wächter, Ermin Wei:
A Decomposition Framework for Nonlinear Nonconvex Two-Stage Optimization. 1211-1238 - Mohammad Ali Ahmadpoor, Abbas Moameni:
Stratified Monge-Kantorovich Optimal Transport Problems. 1239-1268 - Lijun Ding, Alex L. Wang:
Sharpness and Conditioning of Nonsmooth Convex Formulations in Statistical Signal Recovery. 1269-1296 - Felipe Atenas, Heinz H. Bauschke, Minh N. Dao, Matthew K. Tam:
Relocated Fixed-Point Iterations with Applications to Variable Stepsize Resolvent Splitting. 1297-1325 - Wenjin Zhang, Yong Li:
Uniform Exponential Convergence of SAA with AMIS and Asymptotics of Its Optimal Value. 1326-1355 - Shima Dezfulian, Andreas Wächter:
On the Convergence of Interior-Point Methods for Bound-Constrained Nonlinear Optimization Problems with Noise. 1356-1386 - Jiawang Nie, Jane J. Ye, Suhan Zhong:
Partial Lagrange Multiplier Expressions and Disjunctive Decompositions for Bilevel Optimization. 1387-1419 - Radu Ioan Bot, Enis Chenchene:
Extragradient Method with Flexible Anchoring: Strong Convergence and Fast Residual Decay. 1420-1445 - Meixia Lin, Yangjing Zhang:
Low Rank Convex Clustering for Matrix-Valued Observations. 1446-1475 - Roey Merchav, Shoham Sabach, Marc Teboulle:
Dynamic FISTA for Convex Composite Bilevel Optimization. 1476-1508 - Daniel Berg Thomsen, Nikita Doikov:
Complexity of Minimizing Regularized Convex Quadratic Functions. 1509-1536 - Pengfei Huang, Minru Bai:
An Ideal-Sparse Generalized Moment Problem Reformulation for Completely Positive Tensor Decomposition Exploiting Maximal Cliques of Multi-hypergraphs. 1537-1562 - Elvira Moreno, Venkat Chandrasekaran:
Spectral Methods for Polynomial Optimization. 1563-1588 - Jiyoung Choi, Jiawang Nie, Xindong Tang, Suhan Zhong:
Generalized Nash Equilibrium Problems with Quasi-linear Constraints. 1589-1618 - Yue Wu, Benjamin Grimmer:
Some Unified Theory for Variance Reduced Prox-Linear Methods. 1619-1646 - Marek Tyburec, Michal Kocvara, Marouan Handa, Jan Zeman:
Global Weight Optimization of Frame Structures under Free-Vibration Eigenvalue Constraints. 1647-1677 - Helmut Gfrerer, Jirí V. Outrata:
On the Role of Semismoothness in Nonsmooth Numerical Analysis: Theory. 1678-1705 - Welington de Oliveira, Valentina Sessa, David Sossa:
Measuring Dissimilarity between Convex Cones by Means of Max-Min Angles. 1706-1730 - Caleb Ju, Guanghui Lan:
Policy Optimization over General State and Action Spaces. 1731-1772 - Junwen Qiu, Li Jiang, Andre Milzarek:
A Normal Map-Based Proximal Stochastic Gradient Method: Convergence and Identification Properties. 1773-1804
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.
last updated on 2026-08-24 23:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
