Copertina

A stochastic moving ball approximation method for smooth convex constrained minimization

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Singh, Nitesh Kumar, Necoara, Ion
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Optimization and Control
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

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

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

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

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

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

A smoothing moving balls approximation method for a class of conic-constrained difference-of-convex optimization problems
di: Xu, Jiefeng, et al.
Pubblicazione: (2025)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

A heavy-ball type curve search method for smooth convexly constrained optimization
di: Donnini, Federica, et al.
Pubblicazione: (2026)

Learning based convex approximation for constrained parametric optimization
di: Liu, Kang, et al.
Pubblicazione: (2025)

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

A stochastic method of moving asymptotes for topology optimization under uncertainty
di: Pflug, Lukas, et al.
Pubblicazione: (2024)

Stochastic dual coordinate descent with adaptive heavy ball momentum for linearly constrained convex optimization
di: Zeng, Yun, et al.
Pubblicazione: (2023)

Closest univariate convex linear-quadratic function approximation with minimal number of Pieces
di: Kundu, Namrata, et al.
Pubblicazione: (2025)

Continuous and discrete-time accelerated methods for an inequality constrained convex optimization problem
di: Liu, Juan, et al.
Pubblicazione: (2024)

Nonsmooth nonconvex stochastic heavy ball
di: Le, Tam
Pubblicazione: (2023)

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

A novel dual-decomposition method for non-convex two-stage stochastic mixed-integer quadratically constrained quadratic problems
di: Belyak, Nikita, et al.
Pubblicazione: (2023)

Zeroth-Order Non-smooth Non-convex Optimization via Gaussian Smoothing
di: Paul, Anik Kumar, et al.
Pubblicazione: (2025)

On quasi-convex smooth optimization problems by a comparison oracle
di: Gasnikov, A. V., et al.
Pubblicazione: (2024)

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