Cover Image

Convergence Rates for $\ell_p$ Norm Minimization in Convex Vector Optimization

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Alshahrani, Mohammed
Format:	Preprint
Published:	2026
Subjects:	Optimization and Control Numerical Analysis 90C29, 90C25, 65K05, 52A21, 46B20
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Adaptive Metrics for Norm-Minimization-Based Outer Approximation in Convex Vector Optimization
by: Alshahrani, Mohammed
Published: (2026)

The Global R-linear Convergence of Nesterov's Accelerated Gradient Method with Unknown Strongly Convex Parameter
by: Bao, Chenglong, et al.
Published: (2023)

On Solution Uniqueness and Robust Recovery for Sparse Regularization with a Gauge: from Dual Point of View
by: He, Jiahuan, et al.
Published: (2023)

A Random Active Set Method for Strictly Convex Quadratic Problem with Simple Bounds
by: Gu, Ran, et al.
Published: (2021)

Objective-Function Free Multi-Objective Optimization: Rate of Convergence and Performance of an Adagrad-like algorithm
by: De Santis, Marianna, et al.
Published: (2026)

Asymptotic Linear Convergence of ADMM for Isotropic TV Norm Compressed Sensing
by: Torres, Emmanuel Gil, et al.
Published: (2025)

Essential Convergence Rates of Continuous-Time Models for Optimization Methods
by: Ushiyama, Kansei, et al.
Published: (2025)

Nonsmooth Convex Optimization using the Specular Gradient Method with Root-Linear Convergence
by: Jung, Kiyuob, et al.
Published: (2024)

A New Linear Programming Approach and a New Backtracking Strategy for Multiple-Gradient Descent in Multi-Objective Optimization
by: Della Santa, Francesco
Published: (2024)

Simplex Frank-Wolfe: Linear Convergence and Its Numerical Efficiency for Convex Optimization over Polytopes
by: Wang, Haoning, et al.
Published: (2025)

Accelerated Gradient Methods with Gradient Restart: Global Linear Convergence
by: Bao, Chenglong, et al.
Published: (2024)

A Near-Optimal Total Complexity for the Inexact Accelerated Proximal Gradient Method via Quadratic Growth
by: Li, Hongda, et al.
Published: (2026)

Convergence analysis of a primal-dual optimization-by-continuation algorithm
by: Loris, Ignace, et al.
Published: (2023)

A new problem qualification based on approximate KKT conditions for Lipschitzian optimization with application to bilevel programming
by: Käming, Isabella, et al.
Published: (2024)

Optimization in Theory and Practice
by: Wright, Stephen J.
Published: (2025)

Strong Convergence of FISTA for Affinely Constrained Convex Quadratic Minimization
by: Bartz, Sedi, et al.
Published: (2026)

A modified exact penalty approach for general constrained $\ell_0$-sparse optimization problems
by: Kanzow, Christian, et al.
Published: (2025)

Symplectic Discretization Approach for Developing New Proximal Point Algorithm
by: Yuan, Ya-xiang, et al.
Published: (2023)

Spectral conjugate gradient projection methods for large-scale monotone equations without Lipschitz continuity
by: Hamiss, Kabenge, et al.
Published: (2026)

Anderson Accelerated Primal-Dual Hybrid Gradient for solving LP
by: Zhou, Yingxin, et al.
Published: (2025)

On the Convergence Rates of Iterative Regularization Algorithms for Composite Bi-Level Optimization
by: Shtern, Shimrit, et al.
Published: (2025)

Lipschitz continuity of solution multifunctions of extended $\ell_1$ regularization problems
by: Meng, Kaiwen, et al.
Published: (2024)

Greedy Learning to Optimize with Convergence Guarantees
by: Fahy, Patrick, et al.
Published: (2024)

Adaptive Multilevel Newton: A Quadratically Convergent Optimization Method
by: Tsipinakis, Nick, et al.
Published: (2025)

Performance Estimation for Smooth and Strongly Convex Sets
by: Luner, Alan, et al.
Published: (2024)

Heavy Ball Momentum for Non-Strongly Convex Optimization
by: Aujol, Jean-François, et al.
Published: (2024)

Accelerating Diagonal Methods for Bilevel Optimization: Unified Convergence via Continuous-Time Dynamics
by: Boţ, Radu Ioan, et al.
Published: (2025)

On the geometry of circumcentric directions of cones
by: Bello-Cruz, Yunier
Published: (2026)

A Trust Region Proximal Gradient Method for Nonlinear Multi-objective Optimization Problems
by: Ansary, Md Abu Talhamainuddin
Published: (2024)

Trust-Region Method for Optimization of Set-Valued Maps Given by Finitely Many Functions
by: Ghosh, Suprova, et al.
Published: (2025)

Linesearch-free adaptive Bregman proximal gradient for convex minimization without relative smoothness
by: Ou, Hongjia, et al.
Published: (2025)

Dynamic FISTA for Convex Composite Bi-Level Optimization
by: Merchav, Roey, et al.
Published: (2024)

Augmented Lagrangian methods for fully convex composite optimization
by: De Marchi, Alberto, et al.
Published: (2025)

Linear Convergence and Error Bounds for Optimization Without Strong Convexity
by: van Treek, Kira, et al.
Published: (2025)

Stochastic Block Bregman Projection with Polyak-like Stepsize for Possibly Inconsistent Convex Feasibility Problems
by: Zhang, Lu, et al.
Published: (2026)

Interval-Valued Optimization Problems for Strongly LU-E-Invex and Strongly LU-E-Preinvex Functions
by: Tauheed, et al.
Published: (2026)

A Single-Loop Stochastic Proximal Quasi-Newton Method for Large-Scale Nonsmooth Convex Optimization
by: Song, Yongcun, et al.
Published: (2024)

A Symplectic Discretization Based Proximal Point Algorithm for Convex Minimization
by: Yuan, Ya-xiang, et al.
Published: (2024)

Robust optimality and duality for composite uncertain multiobjective optimization in Asplund spaces with its applications
by: Saadati, Maryam, et al.
Published: (2022)

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