Image de couverture de livre

Lipschitz continuity of solution multifunctions of extended $\ell_1$ regularization problems

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Meng, Kaiwen, Wu, Pengcheng, Yang, Xiaoqi
Format:	Preprint
Publié:	2024
Sujets:	Optimization and Control 65K05, 90C25, 90C31
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Adaptive proximal algorithms for convex optimization under local Lipschitz continuity of the gradient
par: Latafat, Puya, et autres
Publié: (2023)

Extragradient method with feasible inexact projection to variational inequality problem
par: Millán, R. Díaz, et autres
Publié: (2023)

Monomial barrier functions for the box-constrained convex optimization problems
par: Fayed, Hatem
Publié: (2024)

Strong Partitioning and a Machine Learning Approximation for Accelerating the Global Optimization of Nonconvex QCQPs
par: Kannan, Rohit, et autres
Publié: (2022)

Preconditioned Proximal Gradient Methods with Conjugate Momentum: A Subspace Perspective
par: Chen, Jian, et autres
Publié: (2026)

On Solution Uniqueness and Robust Recovery for Sparse Regularization with a Gauge: from Dual Point of View
par: He, Jiahuan, et autres
Publié: (2023)

Randomized block proximal method with locally Lipschitz continuous gradient
par: Pérez-Aros, Pedro, et autres
Publié: (2025)

Performance Estimation for Smooth and Strongly Convex Sets
par: Luner, Alan, et autres
Publié: (2024)

On Averaging and Extrapolation for Gradient Descent
par: Luner, Alan, et autres
Publié: (2024)

Simplex Frank-Wolfe: Linear Convergence and Its Numerical Efficiency for Convex Optimization over Polytopes
par: Wang, Haoning, et autres
Publié: (2025)

A Regression-Based Prediction-Correction Method for Stochastic Time-Varying Optimization Problems
par: Kamijima, Tomoya, et autres
Publié: (2025)

Stochastic Block Bregman Projection with Polyak-like Stepsize for Possibly Inconsistent Convex Feasibility Problems
par: Zhang, Lu, et autres
Publié: (2026)

A Random Active Set Method for Strictly Convex Quadratic Problem with Simple Bounds
par: Gu, Ran, et autres
Publié: (2021)

Active set identification and rapid convergence for degenerate primal-dual problems
par: Díaz, Mateo, et autres
Publié: (2026)

Bregman Stochastic Proximal Point Algorithm with Variance Reduction
par: Traoré, Cheik, et autres
Publié: (2025)

On the convergence of proximal gradient methods for convex simple bilevel optimization
par: Latafat, Puya, et autres
Publié: (2023)

Distributed Gradient-Regularized Newton Method: Scheduled Consensus and O(epsilon^{-1}) Global Iteration Complexity
par: Hu, Wei, et autres
Publié: (2026)

Nonsmooth Projection-Free Optimization with Functional Constraints
par: Asgari, Kamiar, et autres
Publié: (2023)

Bounding-Focused Discretization Methods for the Global Optimization of Nonconvex Semi-Infinite Programs
par: Turan, Evren M., et autres
Publié: (2023)

Sharp bounds in perturbed smooth optimization
par: Spokoiny, Vladimir
Publié: (2025)

On solving a rank regularized minimization problem via equivalent factorized column-sparse regularized models
par: Li, Wenjing, et autres
Publié: (2023)

A New Two-dimensional Model-based Subspace Method for Large-scale Unconstrained Derivative-free Optimization: 2D-MoSub
par: Xie, Pengcheng, et autres
Publié: (2023)

A modified exact penalty approach for general constrained $\ell_0$-sparse optimization problems
par: Kanzow, Christian, et autres
Publié: (2025)

Dynamic FISTA for Convex Composite Bi-Level Optimization
par: Merchav, Roey, et autres
Publié: (2024)

Bregman proximal gradient method for linear optimization under entropic constraints
par: Briceño-Arias, Luis M., et autres
Publié: (2025)

A novel numerical method tailored for unconstrained optimization problems
par: Li, Lin, et autres
Publié: (2025)

A Busemann hybrid projection-proximal point algorithm for optimization problems on Hadamard manifolds
par: Millán, R. Díaz, et autres
Publié: (2026)

A Single-Loop Stochastic Proximal Quasi-Newton Method for Large-Scale Nonsmooth Convex Optimization
par: Song, Yongcun, et autres
Publié: (2024)

Fast Frank--Wolfe Algorithms with Adaptive Bregman Step-Size for Weakly Convex Functions
par: Takahashi, Shota, et autres
Publié: (2025)

Stability analysis of split equality and split feasibility problems
par: Huong, Vu Thi, et autres
Publié: (2024)

General Optimal Step-size for ADMM-type Algorithms: Domain Parametrization and Optimal Rates
par: Ran, Yifan
Publié: (2023)

Anderson Accelerated Primal-Dual Hybrid Gradient for solving LP
par: Zhou, Yingxin, et autres
Publié: (2025)

Accelerated Gradient Methods with Gradient Restart: Global Linear Convergence
par: Bao, Chenglong, et autres
Publié: (2024)

The Global R-linear Convergence of Nesterov's Accelerated Gradient Method with Unknown Strongly Convex Parameter
par: Bao, Chenglong, et autres
Publié: (2023)

Boosted Stochastic Frank-Wolfe for Constrained Nonconvex Optimization
par: Nandhan, Navil, et autres
Publié: (2026)

BUP-TR: Bayesian Underdetermined Projection Trust-Region Methods for Derivative-Free Optimization
par: Hu, Wei, et autres
Publié: (2026)

MATRO: Metric-Aware Trust-Region Optimization with Fully Quadratic Models
par: Hu, Wei, et autres
Publié: (2026)

Splitting Algorithms for Distributionally Robust Optimization
par: Briceño-Arias, Luis, et autres
Publié: (2024)

On Difference-of-SOS and Difference-of-Convex-SOS Decompositions for Polynomials
par: Niu, Yi-Shuai, et autres
Publié: (2018)

A Proximal Stochastic Gradient Method with Adaptive Step Size and Variance Reduction for Convex Composite Optimization
par: Fang, Changjie, et autres
Publié: (2025)