Cover Image

On the B-subdifferential of proximal operators of affine-constrained $\ell_1$ regularizer

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Li, Xudong, Lin, Meixia, Toh, Kim-Chuan
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

On the efficient computation of proximal operators of affine-constrained nonconvex functions
by: Hou, Di, et al.
Published: (2026)

Wasserstein distributionally robust optimization and its tractable regularization formulations
by: Chu, Hong T. M., et al.
Published: (2024)

Adaptive sieving: A dimension reduction technique for sparse optimization problems
by: Yuan, Yancheng, et al.
Published: (2023)

Calculus rules for proximal ε-subdifferentials and inexact proximity operators for weakly convex functions
by: Bednarczuk, Ewa, et al.
Published: (2022)

On exploration of an interior mirror descent flow for stochastic nonconvex constrained problem
by: Ding, Kuangyu, et al.
Published: (2025)

Robust principal component analysis with rank and cardinality regularization under matrix factorization
by: Li, Wenjing, et al.
Published: (2026)

On the complexity of proximal gradient and proximal gradient-Newton-CG methods for \(\ell_1\)-regularized Optimization
by: Zhu, Hong
Published: (2025)

Stochastic Bregman Subgradient Methods for Nonsmooth Nonconvex Optimization Problems
by: Ding, Kuangyu, et al.
Published: (2024)

Inexact Bregman Proximal Gradient Method and its Inertial Variant with Absolute and Partial Relative Stopping Criteria
by: Yang, Lei, et al.
Published: (2021)

On the convergence rates of moment-SOS hierarchies approximation of truncated moment sequences
by: Tran, Hoang Anh, et al.
Published: (2025)

Bregman level proximal subdifferentials and new characterizations of Bregman proximal operators
by: Wang, Ziyuan, et al.
Published: (2025)

Accelerating nuclear-norm regularized low-rank matrix optimization through Burer-Monteiro decomposition
by: Lee, Ching-pei, et al.
Published: (2022)

RiNNAL+: a Riemannian ALM Solver for SDP-RLT Relaxations of Mixed-Binary Quadratic Programs
by: Hou, Di, et al.
Published: (2025)

An Inexact Bregman Proximal Difference-of-Convex Algorithm with Two Types of Relative Stopping Criteria
by: Yang, Lei, et al.
Published: (2024)

On solving a rank regularized minimization problem via equivalent factorized column-sparse regularized models
by: Li, Wenjing, et al.
Published: (2023)

Nonconvex Stochastic Bregman Proximal Gradient Method with Application to Deep Learning
by: Ding, Kuangyu, et al.
Published: (2023)

Tensor train based sampling algorithms for approximating regularized Wasserstein proximal operators
by: Han, Fuqun, et al.
Published: (2024)

On decomposability and subdifferential of the tensor nuclear norm
by: Guan, Jiewen, et al.
Published: (2025)

An Exact Penalty Approach for Equality Constrained Optimization over a Convex Set
by: Xiao, Nachuan, et al.
Published: (2025)

Partial Envelope for Optimization Problem with Nonconvex Constraints
by: Hu, Xiaoyin, et al.
Published: (2025)

Convergence Analysis of a Relative-type Inexact Preconditioned Proximal ALM for Convex Nonlinear Programming
by: Yang, Lei, et al.
Published: (2025)

A Hybrid Subgradient Method for Nonsmooth Nonconvex Bilevel Optimization
by: Xiao, Nachuan, et al.
Published: (2025)

A Quadratically Convergent Alternating Projection Method for Nonconvex Sets
by: Xiao, Nachuan, et al.
Published: (2025)

ripALM: A Relative-Type Inexact Proximal Augmented Lagrangian Method for Linearly Constrained Convex Optimization
by: Zhu, Jiayi, et al.
Published: (2024)

Learning-rate-free Momentum SGD with Reshuffling Converges in Nonsmooth Nonconvex Optimization
by: Hu, Xiaoyin, et al.
Published: (2024)

A Minimization Approach for Minimax Optimization with Coupled Constraints
by: Hu, Xiaoyin, et al.
Published: (2024)

LoCo: Low-Bit Communication Adaptor for Large-scale Model Training
by: Xie, Xingyu, et al.
Published: (2024)

Characterizations of inexact proximal operators
by: Lauga, Guillaume, et al.
Published: (2026)

Learning Graph Laplacian with MCP
by: Zhang, Yangjing, et al.
Published: (2020)

Optimality conditions and subdifferential calculus for infinite sums of functions
by: Hantoute, Abderrahim, et al.
Published: (2024)

Improved Rates for Stochastic Variance-Reduced Difference-of-Convex Algorithms
by: Nguyen, Anh Duc, et al.
Published: (2025)

A proximal subgradient algorithm for constrained multiobjective DC-type optimization
by: Van Tuyen, Nguyen, et al.
Published: (2025)

Inexact Accelerated Proximal Gradient Method Revisit: An Economical Variant via Shadow Points
by: Yang, Lei, et al.
Published: (2025)

A convex, finite and lower semicontinuous function with empty subdifferential
by: Wachsmuth, Gerd
Published: (2024)

On subdifferential chain rule of matrix factorization and beyond
by: Guan, Jiewen, et al.
Published: (2024)

On invex functions with same η in single and multivalued nonsmooth optimization with Clarke's subdifferential
by: Rinne, Ville, et al.
Published: (2025)

Adam-family Methods for Nonsmooth Optimization with Convergence Guarantees
by: Xiao, Nachuan, et al.
Published: (2023)

Developing Lagrangian-based Methods for Nonsmooth Nonconvex Optimization
by: Xiao, Nachuan, et al.
Published: (2024)

CDOpt: A Python Package for a Class of Riemannian Optimization
by: Xiao, Nachuan, et al.
Published: (2022)

Stochastic Subgradient Methods with Guaranteed Global Stability in Nonsmooth Nonconvex Optimization
by: Xiao, Nachuan, et al.
Published: (2023)