Cover Image

Global convergence of the gradient method for functions definable in o-minimal structures

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Josz, Cédric
Format:	Preprint
Published:	2023
Subjects:	Optimization and Control 03C64 90C26 90C30
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Global convergence of gradient descent for phase retrieval
by: Fougereux, Théodore, et al.
Published: (2024)

The adjoint state method for parametric definable optimization without smoothness or uniqueness
by: Bolte, Jérôme, et al.
Published: (2026)

Penalty decomposition derivative free method for the minimization of partially separable functions over a convex feasible set
by: Cecere, Francesco, et al.
Published: (2025)

On convergence of a $q$-random coordinate constrained algorithm for non-convex problems
by: Ghaffari-Hadigheh, Alireza, et al.
Published: (2022)

A Globally Convergent Gradient Method with Momentum
by: Lapucci, Matteo, et al.
Published: (2024)

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

A minimal face constant rank constraint qualification for reducible conic programming
by: Andreani, Roberto, et al.
Published: (2023)

Randomized block proximal method with locally Lipschitz continuous gradient
by: Pérez-Aros, Pedro, et al.
Published: (2025)

Clash of MINLP Relaxations: Piecewise Linear vs. Global Parabolic
by: Göß, Adrian
Published: (2026)

Extending Linear Convergence of the Proximal Point Algorithm: The Quasar-Convex Case
by: de Brito, José, et al.
Published: (2025)

Star Quasiconvexity: a Unified Approach for Linear Convergence of First-Order Methods Beyond Convexity
by: Khanh, Phan Quoc, et al.
Published: (2025)

A four-operator splitting algorithm for nonconvex and nonsmooth optimization
by: Alcantara, Jan Harold, et al.
Published: (2024)

Splitting Proximal Point Algorithms for the Sum of Prox-Convex Functions
by: de Brito, Jose, et al.
Published: (2026)

Characterizations of Strongly Quasiconvex Functions
by: Hadjisavvas, Nicolas, et al.
Published: (2025)

Alternating minimization for square root principal component pursuit
by: Deng, Shengxiang, et al.
Published: (2024)

Accelerated-gradient-based generalized Levenberg--Marquardt method with oracle complexity bound and local quadratic convergence
by: Marumo, Naoki, et al.
Published: (2022)

Optimization over convex polyhedra via Hadamard parametrizations
by: Tang, Tianyun, et al.
Published: (2024)

Lagrangian Reformulation for Nonconvex Optimization: Tailoring Problems to Specialized Solvers
by: Quintero, Rodolfo A., et al.
Published: (2024)

Effective Front-Descent Algorithms with Convergence Guarantees
by: Lapucci, Matteo, et al.
Published: (2024)

Projection-based curve pattern search for black-box optimization over smooth convex sets
by: Jia, Xiaoxi, et al.
Published: (2025)

Combining Gradient Information and Primitive Directions for High-Performance Mixed-Integer Optimization
by: Lapucci, Matteo, et al.
Published: (2024)

A Surrogate Value Function Formulation for Bilevel Optimization
by: Xu, Mengwei, et al.
Published: (2025)

Derivative-Free Bilevel Optimization with Inexact Lower-Level Solutions
by: Cesaroni, Edoardo, et al.
Published: (2026)

Improving Convergence Guarantees of Random Subspace Second-order Algorithm for Nonconvex Optimization
by: Higuchi, Rei, et al.
Published: (2024)

Bound tightening in lifted formulations: (sub)solver-dependent impact on performance in RLT-based algorithms
by: González-Díaz, Julio, et al.
Published: (2025)

Proximal methods for structured nonsmooth optimization over Riemannian submanifolds
by: Li, Qia, et al.
Published: (2024)

Parameter-free accelerated gradient descent for nonconvex minimization
by: Marumo, Naoki, et al.
Published: (2022)

A theory on the absence of spurious solutions for nonconvex and nonsmooth optimization
by: Josz, Cedric, et al.
Published: (2018)

Global Solutions to Non-Convex Functional Constrained Problems with Hidden Convexity
by: Fatkhullin, Ilyas, et al.
Published: (2025)

A new dual spectral projected gradient method for log-determinant semidefinite programming with hidden clustering structures
by: Namchaisiri, Charles, et al.
Published: (2024)

A Stochastic Quasi-Newton Method in the Absence of Common Random Numbers
by: Menickelly, Matt, et al.
Published: (2023)

Benign landscapes of low-dimensional relaxations for orthogonal synchronization on general graphs
by: McRae, Andrew D., et al.
Published: (2023)

Parabolic Approximation & Relaxation for MINLP
by: Göß, Adrian, et al.
Published: (2024)

On Tackling High-Dimensional Nonconvex Stochastic Optimization via Stochastic First-Order Methods with Non-smooth Proximal Terms and Variance Reduction
by: Xie, Yue, et al.
Published: (2025)

Hidden convexity of quadratic systems and its application to quadratic programming
by: Huy, Nguyen Quang, et al.
Published: (2026)

Riemannian Gradient Method with Momentum
by: Leggio, Filippo, et al.
Published: (2026)

Norm-induced Cuts: Outer Approximation for Lipschitzian Constraint Functions
by: Göß, Adrian, et al.
Published: (2024)

PANOC-lite: A simpler and more efficient algorithm for composite minimization
by: Bodard, Alexander, et al.
Published: (2026)

On the convergence of adaptive first order methods: proximal gradient and alternating minimization algorithms
by: Latafat, Puya, et al.
Published: (2023)

A sensitivity-based method for bilevel optimization problems: Theoretical analysis and computational performance
by: Nolasco, Eduardo, et al.
Published: (2025)