Cover Image

Introducing the method of ellipcenters, a new first order technique for unconstrained optimization

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Behling, Roger, Correa, Ramyro Aquines, Zanatta, Eduarda Ferreira, Guigues, Vincent
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

The Method of Ellipcenters for strongly convex minimization
by: Behling, Roger, et al.
Published: (2026)

Complexity and numerical experiments of a new adaptive generic proximal bundle method
by: Guigues, Vincent, et al.
Published: (2024)

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

Bundle methods with quadratic cuts for deterministic and stochastic strongly convex optimization problems
by: Guigues, Vincent, et al.
Published: (2017)

Parallel Polyhedral Projection Method for the Convex Feasibility Problem
by: Barros, Pablo, et al.
Published: (2025)

Stochastic Quadratic Dynamic Programming
by: Guigues, Vincent, et al.
Published: (2025)

Limited memory gradient methods for unconstrained optimization
by: Ferrandi, Giulia, et al.
Published: (2023)

Parallelizing the Circumcentered-Reflection Method
by: Barros, Pablo, et al.
Published: (2025)

Stability of first-order methods in tame optimization
by: Lai, Lexiao
Published: (2024)

Policies for the Operation of an Ambulance Fleet under Uncertainty based on a New Preparedness Metric
by: Guigues, Vincent, et al.
Published: (2026)

Newton-CG methods for nonconvex unconstrained optimization with Hölder continuous Hessian
by: He, Chuan, et al.
Published: (2023)

Adaptive Newton-CG methods with global and local analysis for unconstrained optimization with Hölder continuous Hessian
by: Zeng, Ziyang, et al.
Published: (2026)

Simple linesearch-free first-order methods for nonconvex optimization
by: Yagishita, Shotaro, et al.
Published: (2025)

On iteratively regularized first-order methods for simple bilevel optimization
by: Samadi, Sepideh, et al.
Published: (2025)

Bounds for the tracking error of first-order online optimization methods
by: Madden, Liam, et al.
Published: (2020)

A robust BFGS algorithm for unconstrained nonlinear optimization problems
by: Yang, Yaguang
Published: (2012)

New Heuristics for the Operation of an Ambulance Fleet under Uncertainty
by: Guigues, Vincent, et al.
Published: (2024)

An optimal first-order method for smooth and strongly convex composite optimization and its stationary limit
by: Upadhyaya, Manu, et al.
Published: (2026)

New operator designs for Halpern iterations with explicit rates under Hölder error bounds
by: Barros, Pablo, et al.
Published: (2026)

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

Computer-aided analyses of stochastic first-order methods, via interpolation conditions for stochastic optimization
by: Rubbens, Anne, et al.
Published: (2025)

A stochastic first-order method with multi-extrapolated momentum for highly smooth unconstrained optimization
by: He, Chuan
Published: (2024)

Counter-examples in first-order optimization: a constructive approach
by: Goujaud, Baptiste, et al.
Published: (2023)

An arc-search BFGS algorithm for unconstrained nonlinear optimization problems
by: Yang, Yaguang
Published: (2026)

An adaptively inexact first-order method for bilevel optimization with application to hyperparameter learning
by: Salehi, Mohammad Sadegh, et al.
Published: (2023)

Automated tight Lyapunov analysis for first-order methods
by: Upadhyaya, Manu, et al.
Published: (2023)

Solving a linear program via a single unconstrained minimization
by: Otemissov, Adilet, et al.
Published: (2025)

Necessary first and second order optimality conditions for a fractional order differential equation with state delay
by: Gasimov, Jasarat J., et al.
Published: (2024)

A perturbed preconditioned gradient descent method for the unconstrained minimization of composite objectives
by: Park, Jea-Hyun, et al.
Published: (2025)

A warmstarting technique for general conic optimization in interior point methods
by: Chen, Yuwen, et al.
Published: (2025)

Second order optimality conditions in a new Lagrangian formulation for optimal control problems
by: Konopik, Michael, et al.
Published: (2025)

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

Another approach to build Lyapunov functions for the first order methods in the quadratic case
by: Merkulov, Daniil, et al.
Published: (2023)

The AutoLyap software suite for computer-assisted Lyapunov analyses of first-order methods
by: Upadhyaya, Manu, et al.
Published: (2025)

An inexact $q$-order regularized proximal Newton method for nonconvex composite optimization
by: Liu, Ruyu, et al.
Published: (2023)

Second-order geometry and Riemannian Newton's method for optimization on the indefinite Stiefel manifold
by: Sato, Hiroyuki
Published: (2026)

A note on first-order and transversality conditions in infinite-horizon continuous-time optimal control models
by: Bosi, Stefano, et al.
Published: (2026)

Direct search for stochastic optimization in random subspaces with zeroth-, first-, and second-order convergence and expected complexity
by: Dzahini, K. J., et al.
Published: (2024)

Efficient globalization of heavy-ball type methods for unconstrained optimization based on curve searches
by: Donnini, Federica, et al.
Published: (2025)

Advancing the lower bounds: An accelerated, stochastic, second-order method with optimal adaptation to inexactness
by: Agafonov, Artem, et al.
Published: (2023)