Cover Image

Stochastic halfspace approximation method for convex optimization with nonsmooth functional constraints

Fuente: arXiv

Saved in:

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

Similar Items

Stochastic subgradient for composite optimization with functional constraints
by: Necoara, Ion, et al.
Published: (2022)

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

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

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

Convergence rates for an inexact linearized ADMM for nonsmooth 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)

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

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

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

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

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

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

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

Hypodifferentials of nonsmooth convex functions and their applications to nonsmooth convex optimization
by: Dolgopolik, M. V.
Published: (2023)

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

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

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

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

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

Stochastic smoothing accelerated gradient method for general constrained nonsmooth convex composite optimization
by: Wang, Ruyu, et al.
Published: (2023)

Signed tropical halfspaces and convexity
by: Loho, Georg, et al.
Published: (2022)

An adaptive proximal safeguarded augmented Lagrangian method for nonsmooth DC problems with convex constraints
by: Kanzow, Christian, 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)

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

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

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

A consensus-based optimization method for nonsmooth nonconvex programs with approximated gradient descent scheme
by: Wei, Jiazhen, et al.
Published: (2025)

Solving mathematical programs with complementarity constraints arising in nonsmooth optimal control
by: Nurkanović, Armin, et al.
Published: (2023)

Stochastic ADMM with batch size adaptation for nonconvex nonsmooth optimization
by: Jin, Jiachen, et al.
Published: (2025)

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

Relations between nonsmooth vector variational inequalities and nonsmooth vector optimization problems on Hadamard manifold in terms of bifunction
by: Singh, Nagendra, et al.
Published: (2024)

A multilevel proximal trust-region method for nonsmooth optimization with applications
by: Baraldi, Robert, et al.
Published: (2025)

Multi-cut stochastic approximation methods for solving stochastic convex composite optimization
by: Liang, Jiaming, et al.
Published: (2025)

A feasible smoothing accelerated projected gradient method for nonsmooth convex optimization
by: Nishioka, Akatsuki, et al.
Published: (2023)

Frank--Wolfe algorithms for piecewise star-convex functions with a nonsmooth difference-of-convex structure
by: Millán, R. Díaz, et al.
Published: (2023)

Universal nonmonotone line search method for nonconvex multiobjective optimization problems with convex constraints
by: Pinheiro, Maria Eduarda, et al.
Published: (2024)

Augmented Lagrangian methods for convex optimization with priority constraints via an infeasibility control framework
by: Yamakawa, Yuya, et al.
Published: (2026)

Distributionally robust halfspace depth
by: Ivanovs, Jevgenijs, et al.
Published: (2021)

On the approximation error for approximating convex bodies using multiobjective optimization
by: Löhne, Andreas, et al.
Published: (2021)

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