:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Dizon, Neil D., Caldwell, Bethany I., Jeyakumar, Vaithilingam, Li, Guoyin
Format:	Preprint
Published:	2026
Subjects:	Optimization and Control
Online Access:	https://arxiv.org/abs/2602.14624
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Piecewise SOS-Convex Moment Optimization and Applications via Exact Semi-Definite Programs
by: Huang, Queenie Yingkun, et al.
Published: (2024)

Accelerated Primal-Dual Proximal Gradient Splitting Methods for Convex-Concave Saddle-Point Problems
by: Luo, Hao
Published: (2024)

A Nesterov-Accelerated Primal-Dual Splitting Algorithm for Convex Nonsmooth Optimization
by: Condat, Laurent, et al.
Published: (2026)

Convex Ternary Quartics Are SOS-Convex
by: Ahmadi, Amir Ali, et al.
Published: (2024)

Damped Proximal Augmented Lagrangian Method for weakly-Convex Problems with Convex Constraints
by: Dahal, Hari, et al.
Published: (2023)

Convergent Lifted Lasserre Hierarchy of SDPs for Minimizing Expectation of Piecewise Polynomial Loss over Wasserstein Balls
by: Dizon, N. D., et al.
Published: (2026)

Some Primal-Dual Theory for Subgradient Methods for Strongly Convex Optimization
by: Grimmer, Benjamin, et al.
Published: (2023)

Hinge-Proximal Stochastic Gradient Methods for Convex Optimization with Functional Constraints
by: Rajoriya, Vaibhav, et al.
Published: (2025)

Exponential Stability of Primal-Dual Gradient Dynamics with Non-Strong Convexity
by: Chen, Xin, et al.
Published: (2019)

Weakly Convex Regularisers for Inverse Problems: Convergence of Critical Points and Primal-Dual Optimisation
by: Shumaylov, Zakhar, et al.
Published: (2024)

A Moment-SOS Hierarchy for Robust Polynomial Matrix Inequality Optimization with SOS-Convexity
by: Guo, Feng, et al.
Published: (2023)

Accuracy Certificates for Convex Optimization at Accelerated Rates via Primal-Dual Averaging
by: Burns, Matthew X., et al.
Published: (2026)

Online Newton Method for Bandit Convex Optimisation
by: Fokkema, Hidde, et al.
Published: (2024)

Bandit Convex Optimisation
by: Lattimore, Tor
Published: (2024)

A Passivity-Based Method for Accelerated Convex Optimisation
by: Cho, Namhoon, et al.
Published: (2023)

A Proximal Descent Method for Minimizing Weakly Convex Optimization
by: Liao, Feng-Yi, et al.
Published: (2025)

Optimal Acceleration for Proximal Minimization of the Sum of Convex and Strongly Convex Functions
by: Chari, Govind M., et al.
Published: (2026)

A Proximal Method for Composite Optimization with Smooth and Convex Components
by: Uzun, Samet, et al.
Published: (2025)

Distributed and Inexact Proximal Gradient Method for Online Convex Optimization
by: Bastianello, Nicola, et al.
Published: (2020)

On Difference-of-SOS and Difference-of-Convex-SOS Decompositions for Polynomials
by: Niu, Yi-Shuai, et al.
Published: (2018)

Optimal Primal-Dual Algorithm with Last iterate Convergence Guarantees for Stochastic Convex Optimization Problems
by: Boob, Digvijay, et al.
Published: (2024)

Robust Learning Meets Quasar-Convex Optimization: Inexact High-Order Proximal-Point Methods
by: Kabgani, Alireza, et al.
Published: (2026)

Inexact and Implementable Accelerated Newton Proximal Extragradient Method for Convex Optimization
by: Huang, Ziyu, et al.
Published: (2024)

Adaptive Proximal Gradient Method for Convex Optimization
by: Malitsky, Yura, et al.
Published: (2023)

Comparison of Proximal First-Order Primal and Primal-Dual algorithms via Performance Estimation
by: Bousselmi, Nizar, et al.
Published: (2024)

Stability of Primal-Dual Gradient Flow Dynamics for Multi-Block Convex Optimization Problems
by: Ozaslan, Ibrahim K., et al.
Published: (2024)

Operator Splitting for Convex Constrained Markov Decision Processes
by: Grontas, Panagiotis D., et al.
Published: (2024)

A Unified Primal-Dual Recipe for Accelerating Three-Operator Splitting Methods
by: Sadiev, Abdurakhmon, et al.
Published: (2026)

Beyond Convexity: Proximal-Perturbed Lagrangian Methods for Efficient Functional Constrained Optimization
by: Moon, Sang Bin, et al.
Published: (2024)

Linear Convergence of a Unified Primal--Dual Algorithm for Convex--Concave Saddle Point Problems with Quadratic Growth
by: Melcher, Cody, et al.
Published: (2025)

Splitting Proximal Point Algorithms for the Sum of Prox-Convex Functions
by: de Brito, Jose, et al.
Published: (2026)

New Primal-Dual Algorithm for Convex Problems
by: Liu, Shuning, et al.
Published: (2025)

Consensus Planning with Primal, Dual, and Proximal Agents
by: Maggiar, Alvaro, et al.
Published: (2024)

A Low-rank Augmented Lagrangian Method for Polyhedral-SDP and Moment-SOS Relaxations of Polynomial Optimization
by: Hou, Di, et al.
Published: (2025)

Weak Proximal Newton Oracles for Composite Convex Optimization
by: Garber, Dan
Published: (2025)

Robust Accelerated Primal-Dual Methods for Computing Saddle Points
by: Zhang, Xuan, et al.
Published: (2021)

A Zeroth-order Proximal Stochastic Gradient Method for Weakly Convex Stochastic Optimization
by: Pougkakiotis, Spyridon, et al.
Published: (2022)

Extending Douglas-Rachford Splitting for Convex Optimization
by: Nilsson, Max, et al.
Published: (2025)

A Monte Carlo Approach for Nonsmooth Convex Optimization via Proximal Splitting Algorithms
by: Di, Nicholas, et al.
Published: (2025)

Robust Dynamic Operating Envelopes via Superellipsoid-based Convex Optimisation in Unbalanced Distribution Networks
by: Liu, Bin, et al.
Published: (2023)