Cover Image

Moving higher-order Taylor approximations method for smooth constrained minimization problems

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Nabou, Yassine, 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

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

Nonmonotone higher-order Taylor approximation methods for composite problems
by: Nabou, Yassine
Published: (2025)

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

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

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

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)

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

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

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

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

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

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

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

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

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

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

Dynamic inverse problems: Online regularisation theory
by: Jauhiainen, Jyrki, et al.
Published: (2026)

Monotone and nonmonotone linearized block coordinate descent methods for nonsmooth composite optimization problems
by: Nabou, Yassine, et al.
Published: (2025)

Coordinate projected gradient descent minimization and its application to orthogonal nonnegative matrix factorization
by: Chorobura, Flavia, 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)

Complexity of linearized quadratic penalty for optimization with nonlinear equality constraints
by: Bourkhissi, Lahcen El, 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)

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

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

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

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

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

Accelerated Bregman gradient methods for relatively smooth and relatively Lipschitz continuous minimization problems
by: Savchuk, O. S., et al.
Published: (2024)

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

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

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

Exploiting higher-order derivatives in convex optimization methods
by: Kamzolov, Dmitry, et al.
Published: (2022)

Feedback control of Lagrange multipliers for non-smooth constrained optimization
by: Cerone, V., et al.
Published: (2026)

A primal-dual interior point trust region method for second-order stationary points of Riemannian inequality-constrained optimization problems
by: Obara, Mitsuaki, et al.
Published: (2025)

On leveraging constrained smooth additive regression models for global optimization
by: Cuesta, Marina, et al.
Published: (2025)

On second-order weak sharp minima of general nonconvex set-constrained optimization problems
by: Ma, Xiaoxiao, et al.
Published: (2025)

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

Frank-Wolfe-type methods for a class of nonconvex inequality-constrained problems
by: Zeng, Liaoyuan, et al.
Published: (2021)

A comparison on constrain encoding methods for quantum approximate optimization algorithm
by: Liu, Yiwen, et al.
Published: (2024)