Cover Image

The Method of Ellipcenters for strongly convex minimization

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Behling, Roger, Correa, Ramyro, Ferreira, Eduarda, Guigues, Vincent
Format:	Preprint
Published:	2026
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Introducing the method of ellipcenters, a new first order technique for unconstrained optimization
by: Behling, Roger, 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)

The Method of Ellipcenters for Strongly Convex Functions
by: Bello-Cruz, Yunier
Published: (2026)

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)

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

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

Complexity and numerical experiments of a new adaptive generic proximal bundle method
by: Guigues, Vincent, et al.
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)

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

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)

Lyapunov analysis for FISTA under strong convexity
by: Briceño-Arias, Luis M.
Published: (2025)

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

Study of the behaviour of Nesterov Accelerated Gradient in a non convex setting: the strongly quasar convex case
by: Hermant, Julien, et al.
Published: (2024)

Approximation analysis for the minimization problem of difference-of-convex functions with Moreau envelopes
by: Tang, Yan, et al.
Published: (2024)

Convergence rates of regularized quasi-Newton methods without strong convexity
by: Wang, Shida, et al.
Published: (2025)

A $\sqrt{2}$-accelerated FISTA for composite strongly convex problems
by: Ushiyama, Kansei
Published: (2025)

Convergence rates of Newton's method for strongly self-concordant minimization
by: Tsipinakis, Nick, et al.
Published: (2025)

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

Global and local approaches for the minimization of a sum of pointwise minima of convex functions
by: Van Dessel, Guillaume, et al.
Published: (2025)

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)

Dualities for non-Euclidean smoothness and strong convexity under the light of generalized conjugacy
by: Laude, Emanuel, et al.
Published: (2021)

A globalized inexact semismooth Newton method for strongly convex optimal control problems
by: Wachsmuth, Daniel
Published: (2025)

Optimal and parameter-free gradient minimization methods for convex and nonconvex optimization
by: Lan, Guanghui, et al.
Published: (2023)

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

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

Polyak-Łojasiewicz inequality is essentially no more general than strong convexity for $C^2$ functions
by: Nejma, Aziz Ben
Published: (2025)

Frank-Wolfe algorithm for star-convex functions
by: Millan, R. Diaz, et al.
Published: (2025)

Spectral Preconditioning for Gradient Methods on Graded Non-convex Functions
by: Doikov, Nikita, et al.
Published: (2024)

Basis pursuit by inconsistent alternating projections
by: Behling, Roger, et al.
Published: (2025)

Operation of an ambulance fleet under uncertainty
by: Guigues, Vincent, et al.
Published: (2022)

Nesterov acceleration for the Wasserstein minimization of displacement-convex free energies
by: Monmarché, Pierre
Published: (2026)

Parallelizable Riemannian Alternating Direction Method of Multipliers for Non-convex Pose Graph Optimization
by: Chen, Xin, et al.
Published: (2026)

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)

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

Optimal $L^p$-approximation of convex sets by convex subsets
by: Fattah, Zakaria, et al.
Published: (2025)

Lower Complexity Bounds of First-order Methods for Affinely Constrained Composite Non-convex Problems
by: Liu, Wei, et al.
Published: (2025)

A Near-optimal Method for Linearly Constrained Composite Non-convex Non-smooth Problems
by: Liu, Wei, et al.
Published: (2025)