Cover Image

Dual Averaging With Non-Strongly-Convex Prox-Functions: New Analysis and Algorithm

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Zhao, Renbo
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The Generalized Multiplicative Gradient Method for A Class of Convex Optimization Problems Over Symmetric Cones
by: Zhao, Renbo
Published: (2022)

An Optimization Perspective on the Monotonicity of the Multiplicative Algorithm for Optimal Experimental Design
by: Zhao, Renbo
Published: (2025)

On the Convexification of Spectral Sets Induced by Non-Invariant Sets
by: Zhao, Renbo
Published: (2024)

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

Prox-PEP: A Proximal Partial Exact Penalty Algorithm for Weakly Convex Stochastic Nonlinear Programming
by: Tang, Lixin, et al.
Published: (2026)

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

The Method of Ellipcenters for Strongly Convex Functions
by: Bello-Cruz, Yunier
Published: (2026)

Exponential Convergence of Augmented Primal-dual Gradient Algorithms for Partially Strongly Convex Functions
by: Li, Mengmou, et al.
Published: (2024)

Minimization of Nonsmooth Weakly Convex Function over Prox-regular Set for Robust Low-rank Matrix Recovery
by: Kume, Keita, 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)

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

The Mirror-Prox Sliding Method for Non-smooth decentralized saddle-point problems
by: Kuruzov, Ilya, et al.
Published: (2022)

On Distributionally Robust Multistage Convex Optimization: New Algorithms and Complexity Analysis
by: Zhang, Shixuan, et al.
Published: (2020)

Popov Mirror-Prox Method for Variational Inequalities
by: Chakraborty, Abhishek, et al.
Published: (2025)

Popov Mirror-Prox for solving Variational Inequalities
by: Chakraborty, Abhishek, et al.
Published: (2024)

Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-Łojasiewicz Inequality
by: Aktas, Fatih Selim, et al.
Published: (2025)

On the Convergence of FedProx with Extrapolation and Inexact Prox
by: Li, Hanmin, et al.
Published: (2024)

Prox-DBRO-VR: A Unified Analysis on Byzantine-Resilient Decentralized Stochastic Composite Optimization with Variance Reduction and Non-Asymptotic Convergence Rates
by: Hu, Jinhui, et al.
Published: (2023)

Some Unified Theory for Variance Reduced Prox-Linear Methods
by: Wu, Yue, et al.
Published: (2024)

Strong Convexity of Sets in Riemannian Manifolds
by: Scieur, Damien, et al.
Published: (2023)

New Outer Approximation Algorithms for Nonsmooth Convex MINLP Problems
by: Wei, Zhou, et al.
Published: (2026)

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

Bregman Douglas-Rachford Splitting Method
by: Ma, Shiqian, et al.
Published: (2025)

Prediction-Correction Algorithm for Time-Varying Smooth Non-Convex Optimization
by: Iwakiri, Hidenori, et al.
Published: (2024)

A Globalized Semismooth Newton Method for Prox-regular Optimization Problems
by: Wu, Yuqia, et al.
Published: (2025)

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

Optimizing Representation in Redistricting: Dual Bounds for Partitioning Problems with Non-Convex Objectives
by: Fravel, Jamie, et al.
Published: (2023)

Tighter Performance Theory of FedExProx
by: Anyszka, Wojciech, et al.
Published: (2024)

The Fastest Known First-Order Method for Minimizing Twice Continuously Differentiable Smooth Strongly Convex Functions
by: Van Scoy, Bryan, et al.
Published: (2025)

Non-Stationary Bandit Convex Optimization: An Optimal Algorithm with Two-Point Feedback
by: He, Chang, et al.
Published: (2025)

Distributed Adaptive Gradient Algorithm with Gradient Tracking for Stochastic Non-Convex Optimization
by: Han, Dongyu, et al.
Published: (2024)

Prox-NAG-GS: A Semi-Implicit Proximal Method for Composite Optimization
by: Wiykiynyuy, Sikeh Gisele, et al.
Published: (2026)

New Characterizations of Nonsmooth Convex Functions via Generalized Derivatives
by: Phat, Vo Thanh
Published: (2026)

Convex Synthesis of First-Order Methods for Time-Varying Smooth Strongly Convex Optimization
by: Van Scoy, Bryan, et al.
Published: (2026)

Estimating Sequences with Memory for Minimizing Convex Non-smooth Composite Functions
by: Dosti, Endrit, et al.
Published: (2025)

One-Point Residual Feedback Algorithms for Distributed Online Convex and Non-convex Optimization
by: Wang, Yaowen, et al.
Published: (2025)

Lipschitz-Free Mirror Descent Methods for Relatively Strongly Convex Functions with/without Absolute and Relative Inexactness
by: Alkousa, Mohammad S., et al.
Published: (2026)

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

A Finite-Time Analysis of TD Learning with Linear Function Approximation without Projections or Strong Convexity
by: Lee, Wei-Cheng, et al.
Published: (2025)

Adaptive Acceleration Without Strong Convexity Priors Or Restarts
by: Cavalcanti, Joao V., et al.
Published: (2025)