Cover Image

Stochastic subgradient for composite optimization with functional constraints

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Necoara, Ion, Singh, Nitesh Kumar
Format:	Preprint
Published:	2022
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Mini-batch stochastic subgradient for functional constrained optimization
by: Singh, Nitesh Kumar, et al.
Published: (2024)

Stochastic halfspace approximation method for convex optimization with nonsmooth functional constraints
by: Singh, Nitesh Kumar, et al.
Published: (2024)

Random minibatch subgradient algorithms for convex problems with functional constraints
by: Nedich, Angelia, et al.
Published: (2019)

A stochastic perturbed augmented Lagrangian method for smooth convex constrained minimization
by: Singh, Nitesh Kumar, et al.
Published: (2025)

A stochastic moving ball approximation method for smooth convex constrained minimization
by: Singh, Nitesh Kumar, et al.
Published: (2024)

Complexity of linearized quadratic penalty for optimization with nonlinear equality constraints
by: Bourkhissi, Lahcen El, et al.
Published: (2024)

Random coordinate descent methods for nonseparable composite optimization
by: Chorobura, Flavia, et al.
Published: (2022)

Convergence rates for an inexact linearized ADMM for nonsmooth nonconvex optimization with nonlinear equality constraints
by: Bourkhissi, Lahcen El, et al.
Published: (2025)

Convergence analysis of linearized $\ell_q$ penalty methods for nonconvex optimization with nonlinear equality constraints
by: Bourkhissi, Lahcen El, et al.
Published: (2025)

Higher-order tensor methods for minimizing difference of convex functions
by: Necoara, Ion
Published: (2024)

Proximal gradient methods with inexact oracle of degree q for composite optimization
by: Nabou, Yassine, et al.
Published: (2024)

A systematic approach to general higher-order majorization-minimization algorithms for (non)convex optimization
by: Necoara, Ion, et al.
Published: (2020)

Complexity of a linearized augmented Lagrangian method for nonconvex minimization with nonlinear equality constraints
by: Bourkhissi, Lahcen El, et al.
Published: (2023)

Coordinate descent methods beyond smoothness and separability
by: Chorobura, Flavia, et al.
Published: (2024)

Convergence analysis of stochastic higher-order majorization-minimization algorithms
by: Lupu, Daniela, et al.
Published: (2021)

Moving higher-order Taylor approximations method for smooth constrained minimization problems
by: Nabou, Yassine, et al.
Published: (2024)

Regularized higher-order Taylor approximation methods for nonlinear least-squares
by: Nabou, Yassine, et al.
Published: (2025)

Exact representation and efficient approximations of linear model predictive control laws via HardTanh type deep neural networks
by: Lupu, Daniela, et al.
Published: (2024)

Efficiency of stochastic coordinate proximal gradient methods on nonseparable composite optimization
by: Necoara, I., et al.
Published: (2021)

Efficiency of higher-order algorithms for minimizing composite functions
by: Nabou, Yassine, et al.
Published: (2022)

Coordinate projected gradient descent minimization and its application to orthogonal nonnegative matrix factorization
by: Chorobura, Flavia, et al.
Published: (2025)

Modified projected Gauss-Newton method for constrained nonlinear least-squares: application to power flow analysis
by: Nabou, Yassine, et al.
Published: (2025)

An accelerated randomized Bregman-Kaczmarz method for strongly convex linearly constraint optimization
by: Tondji, Lionel, et al.
Published: (2025)

An adaptive forward-backward-forward splitting algorithm for solving pseudo-monotone inclusions
by: Chorobura, Flavia, et al.
Published: (2025)

Universal subgradient and proximal bundle methods for convex and strongly convex hybrid composite optimization
by: Guigues, Vincent, et al.
Published: (2024)

Inexact subgradient methods for semialgebraic functions
by: Bolte, Jérôme, et al.
Published: (2024)

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

Convergence of empirical subgradients for optimal transport-based objectives
by: Le, Tam
Published: (2026)

Complexity of Linearized Perturbed Augmented Lagrangian Methods for Nonsmooth Nonconvex Optimization with Nonlinear Equality Constraints
by: Bourkhissi, Lahcen El, et al.
Published: (2025)

An effective subgradient algorithm via Mifflin's line search for nonsmooth nonconvex multiobjective optimization
by: Maleknia, Morteza, et al.
Published: (2024)

On convergence rates of subgradient descent on semialgebraic functions
by: Chzhen, Evgenii, et al.
Published: (2026)

Computing AD-compatible subgradients of convex relaxations of implicit functions
by: Song, Yingkai, et al.
Published: (2025)

On the Worst-Case Analysis of Cyclic Block Coordinate Descent type Algorithms
by: Kamri, Yassine, et al.
Published: (2025)

On Busemann subgradient methods for stochastic minimization in Hadamard spaces
by: Pischke, Nicholas
Published: (2026)

Exact Convergence rate of the subgradient method by using Polyak step size
by: Zamani, Moslem, et al.
Published: (2024)

Inexact subgradient algorithm with a non-asymptotic convergence guarantee for copositive programming problems
by: Nishijima, Mitsuhiro, et al.
Published: (2025)

An inertial ADMM for a class of nonconvex composite optimization with nonlinear coupling constraints
by: Hien, Le Thi Khanh, et al.
Published: (2022)

An Inexact Variable Metric Proximal Gradient-subgradient Algorithm for a Class of Fractional Optimization Problems
by: Yang, Lei, et al.
Published: (2025)

A nonmonotone extrapolated proximal gradient-subgradient algorithm beyond global Lipschitz gradient continuity
by: Yang, Lei, et al.
Published: (2025)

A self-adaptive subgradient extragradient method with conjugate gradient-type direction for pseudomonotone variational inequalities
by: Arzuka, Ibrahim, et al.
Published: (2025)