Image de couverture de livre

The Method of Ellipcenters for Strongly Convex Functions

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Bello-Cruz, Yunier
Format:	Preprint
Publié:	2026
Sujets:	Optimization and Control
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

The Method of Ellipcenters for strongly convex minimization
par: Behling, Roger, et autres
Publié: (2026)

Q-quadratic convergence of the centralized circumcentered-reflection method under a relative interior condition
par: Bello-Cruz, Yunier
Publié: (2026)

A semi-smooth Newton method for the nonlinear conic problem with generalized simplicial cones
par: Armijo, Nicolas F., et autres
Publié: (2026)

A Relative Inexact Proximal Gradient Method with an Explicit Linesearch
par: Bello-Cruz, Yunier, et autres
Publié: (2024)

A Proximal Gradient Method with an Explicit Line search for Multiobjective Optimization
par: Bello-Cruz, Yunier, et autres
Publié: (2024)

Optimal Acceleration for Proximal Minimization of the Sum of Convex and Strongly Convex Functions
par: Chari, Govind M., et autres
Publié: (2026)

Basis pursuit by inconsistent alternating projections
par: Behling, Roger, et autres
Publié: (2025)

Convex Synthesis of First-Order Methods for Time-Varying Smooth Strongly Convex Optimization
par: Van Scoy, Bryan, et autres
Publié: (2026)

The Fastest Known First-Order Method for Minimizing Twice Continuously Differentiable Smooth Strongly Convex Functions
par: Van Scoy, Bryan, et autres
Publié: (2025)

On the geometry of circumcentric directions of cones
par: Bello-Cruz, Yunier
Publié: (2026)

Lipschitz-Free Mirror Descent Methods for Relatively Strongly Convex Functions with/without Absolute and Relative Inexactness
par: Alkousa, Mohammad S., et autres
Publié: (2026)

Restart-Free (Accelerated) Gradient Sliding Methods for Strongly Convex Composite Optimization
par: Wu, Xinming, et autres
Publié: (2026)

Dual Averaging With Non-Strongly-Convex Prox-Functions: New Analysis and Algorithm
par: Zhao, Renbo
Publié: (2025)

A semi-smooth Newton method for general projection equations applied to the nearest correlation matrix problem
par: Armijo, Nicolas F., et autres
Publié: (2024)

Subgradient Methods for Nonsmooth Convex Functions with Adversarial Errors
par: Gösgens, Martijn, et autres
Publié: (2025)

Lower Bounds for Linear Minimization Oracle Methods Optimizing over Strongly Convex Sets
par: Grimmer, Benjamin, et autres
Publié: (2026)

Complexity of Projected Gradient Methods for Strongly Convex Optimization with Hölder Continuous Gradient Terms
par: Chen, Xiaojun, et autres
Publié: (2026)

HNAG$^{++}$: An Accelerated Gradient Method with a Refined Asymptotic Rate for Strongly Convex Optimization
par: Chen, Long, et autres
Publié: (2025)

Strong Convexity of Sets in Riemannian Manifolds
par: Scieur, Damien, et autres
Publié: (2023)

Exponential Convergence of Augmented Primal-dual Gradient Algorithms for Partially Strongly Convex Functions
par: Li, Mengmou, et autres
Publié: (2024)

A finitely convergent circumcenter method for the Convex Feasibility Problem
par: Behling, Roger, et autres
Publié: (2023)

Hinge-Proximal Stochastic Gradient Methods for Convex Optimization with Functional Constraints
par: Rajoriya, Vaibhav, et autres
Publié: (2025)

Advancing Multi-Secant Quasi-Newton Methods for General Convex Functions
par: Lee, Mokhwa, et autres
Publié: (2025)

Some Primal-Dual Theory for Subgradient Methods for Strongly Convex Optimization
par: Grimmer, Benjamin, et autres
Publié: (2023)

Lower Bounds for Frank-Wolfe on Strongly Convex Sets
par: Halbey, Jannis, et autres
Publié: (2026)

Adaptive Acceleration Without Strong Convexity Priors Or Restarts
par: Cavalcanti, Joao V., et autres
Publié: (2025)

Extremum Seeking is Stable for Scalar Maps that are Strictly but Not Strongly Convex
par: McNamee, Patrick, et autres
Publié: (2024)

Beyond Convexity: Proximal-Perturbed Lagrangian Methods for Efficient Functional Constrained Optimization
par: Moon, Sang Bin, et autres
Publié: (2024)

Characterizations, Dynamical Systems and Gradient Methods for Strongly Quasiconvex Functions
par: Lara, Felipe, et autres
Publié: (2024)

Random-Subspace Frank--Wolfe over Strongly Convex Sets
par: Poirion, Pierre-Louis, et autres
Publié: (2026)

Optimal Leveraging of Smoothness and Strong Convexity for Peaceman--Rachford Splitting
par: Briceño-Arias, Luis, et autres
Publié: (2026)

Uniformly Optimal and Parameter-free First-order Methods for Convex and Function-constrained Optimization
par: Deng, Qi, et autres
Publié: (2024)

Exponential Stability of Primal-Dual Gradient Dynamics with Non-Strong Convexity
par: Chen, Xin, et autres
Publié: (2019)

Learning Parametric Convex Functions
par: Schaller, Maximilian, et autres
Publié: (2025)

Polyak Minorant Method for Convex Optimization
par: Devanathan, Nikhil, et autres
Publié: (2023)

Asymptotic Weighted Approximation of Convex Functions
par: Baêta, Fernanda M.
Publié: (2025)

Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-Łojasiewicz Inequality
par: Aktas, Fatih Selim, et autres
Publié: (2025)

Frictionless Hamiltonian Descent and Coordinate Hamiltonian Descent for Strongly Convex Quadratic Problems
par: Wang, Jun-Kun
Publié: (2024)

Revisiting Strong Duality, Hidden Convexity, and Gradient Dominance in the Linear Quadratic Regulator
par: Watanabe, Yuto, et autres
Publié: (2025)

Accelerated Backward Forward Method for Convex Optimization
par: Wang, Zepeng, et autres
Publié: (2026)