Image de couverture de livre

Global minimisation of nonconvex functions by generalising the mirror descent method

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Millán, Reinier Díaz, Ugon, Julien
Format:	Preprint
Publié:	2024
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

Frank-Wolfe algorithm for star-convex functions
par: Millan, R. Diaz, et autres
Publié: (2025)

Application and issues in abstract convexity
par: Millán, Reinier Díaz, et autres
Publié: (2022)

Variational properties of the abstract subdifferential operator
par: Millàn, Reinier Diàz, et autres
Publié: (2022)

On exploration of an interior mirror descent flow for stochastic nonconvex constrained problem
par: Ding, Kuangyu, et autres
Publié: (2025)

Multivariate approximation by polynomial and generalised rational functions
par: Millán, R. Díaz, et autres
Publié: (2021)

Frank--Wolfe algorithms for piecewise star-convex functions with a nonsmooth difference-of-convex structure
par: Millán, R. Díaz, et autres
Publié: (2023)

KKT-based optimality conditions for neural network approximation
par: Peiris, Vinesha, et autres
Publié: (2025)

A consensus-based optimization method for nonsmooth nonconvex programs with approximated gradient descent scheme
par: Wei, Jiazhen, et autres
Publié: (2025)

Learning mirror maps in policy mirror descent
par: Alfano, Carlo, et autres
Publié: (2024)

Extragradient method with feasible inexact projection to variational inequality problem
par: Millán, R. Díaz, et autres
Publié: (2023)

Global convergence of a modified BFGS-type method based on function information for nonconvex multiobjective optimization problems
par: Yang, Yingxue
Publié: (2024)

Exact worst-case convergence rates of gradient descent: a complete analysis for all constant stepsizes over nonconvex and convex functions
par: Rotaru, Teodor, et autres
Publié: (2024)

Adaptive directional decomposition methods for nonconvex constrained optimization
par: Shi, Qiankun, et autres
Publié: (2025)

Long-time dynamics and universality of nonconvex gradient descent
par: Han, Qiyang
Publié: (2025)

Simple linesearch-free first-order methods for nonconvex optimization
par: Yagishita, Shotaro, et autres
Publié: (2025)

An accelerated first-order regularized momentum descent ascent algorithm for stochastic nonconvex-concave minimax problems
par: Zhang, Huiling, et autres
Publié: (2023)

On the efficient computation of proximal operators of affine-constrained nonconvex functions
par: Hou, Di, et autres
Publié: (2026)

Minimizing smooth Kurdyka-Łojasiewicz functions via generalized descent methods: Convergence rate and complexity
par: Ahookhosh, Masoud, et autres
Publié: (2025)

Coordinate descent methods beyond smoothness and separability
par: Chorobura, Flavia, et autres
Publié: (2024)

Stochastic homogenization of nonconvex unbounded integral functionals with generalized Orlicz growth
par: Aruta, Davide, et autres
Publié: (2026)

Global convergence of a BFGS-type algorithm for nonconvex multiobjective optimization problems
par: Prudente, L. F., et autres
Publié: (2023)

Steepest geometric descent for regularized quasiconvex functions
par: Daniilidis, Aris, et autres
Publié: (2023)

On the convergence analysis of the decentralized projected gradient descent method
par: Choi, Woocheol, et autres
Publié: (2023)

An inexact $q$-order regularized proximal Newton method for nonconvex composite optimization
par: Liu, Ruyu, et autres
Publié: (2023)

Frank-Wolfe-type methods for a class of nonconvex inequality-constrained problems
par: Zeng, Liaoyuan, et autres
Publié: (2021)

Active-set Newton-MR methods for nonconvex optimization problems with bound constraints
par: Birgin, Ernesto G., et autres
Publié: (2025)

Almost sure convergence of stochastic Hamiltonian descent methods
par: Williamson, Måns, et autres
Publié: (2024)

Mirror descent method for stochastic multi-objective optimization
par: Yang, Linxi, et autres
Publié: (2024)

Random coordinate descent methods for nonseparable composite optimization
par: Chorobura, Flavia, et autres
Publié: (2022)

Improvements to steepest descent method for multi-objective optimization
par: Chen, Wang, et autres
Publié: (2023)

Universal nonmonotone line search method for nonconvex multiobjective optimization problems with convex constraints
par: Pinheiro, Maria Eduarda, et autres
Publié: (2024)

Complexity of a linearized augmented Lagrangian method for nonconvex minimization with nonlinear equality constraints
par: Bourkhissi, Lahcen El, et autres
Publié: (2023)

Optimal and parameter-free gradient minimization methods for convex and nonconvex optimization
par: Lan, Guanghui, et autres
Publié: (2023)

Characterization theorem for best polynomial spline approximation with free knots
par: Sukhorukova, Nadezda, et autres
Publié: (2014)

Newton and interior-point methods for (constrained) nonconvex-nonconcave minmax optimization with stability and instability guarantees
par: Chinchilla, Raphael, et autres
Publié: (2022)

General Proximal Quasi-Newton Methods based on model functions for nonsmooth nonconvex problems
par: Jia, Xiaoxi
Publié: (2025)

Face relative interior of convex sets in topological vector spaces
par: án, Reinier Díaz Mill, et autres
Publié: (2023)

Convergence analysis of linearized $\ell_q$ penalty methods for nonconvex optimization with nonlinear equality constraints
par: Bourkhissi, Lahcen El, et autres
Publié: (2025)

Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization
par: Bodard, Alexander, et autres
Publié: (2025)

The inexact power augmented Lagrangian method for constrained nonconvex optimization
par: Bodard, Alexander, et autres
Publié: (2024)