:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Millán, Reinier Díaz, Ugon, Julien
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control
Online Access:	https://arxiv.org/abs/2402.04281
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Application and issues in abstract convexity
by: Millán, Reinier Díaz, et al.
Published: (2022)

Variational properties of the abstract subdifferential operator
by: Millàn, Reinier Diàz, et al.
Published: (2022)

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

Multivariate approximation by polynomial and generalised rational functions
by: Millán, R. Díaz, et al.
Published: (2021)

On exploration of an interior mirror descent flow for stochastic nonconvex constrained problem
by: Ding, Kuangyu, et al.
Published: (2025)

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)

KKT-based optimality conditions for neural network approximation
by: Peiris, Vinesha, et al.
Published: (2025)

Extragradient method with feasible inexact projection to variational inequality problem
by: Millán, R. Díaz, et al.
Published: (2023)

Learning mirror maps in policy mirror descent
by: Alfano, Carlo, et al.
Published: (2024)

A consensus-based optimization method for nonsmooth nonconvex programs with approximated gradient descent scheme
by: Wei, Jiazhen, et al.
Published: (2025)

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

Exact worst-case convergence rates of gradient descent: a complete analysis for all constant stepsizes over nonconvex and convex functions
by: Rotaru, Teodor, et al.
Published: (2024)

Long-time dynamics and universality of nonconvex gradient descent
by: Han, Qiyang
Published: (2025)

Characterization theorem for best polynomial spline approximation with free knots
by: Sukhorukova, Nadezda, et al.
Published: (2014)

Adaptive directional decomposition methods for nonconvex constrained optimization
by: Shi, Qiankun, et al.
Published: (2025)

Face relative interior of convex sets in topological vector spaces
by: án, Reinier Díaz Mill, et al.
Published: (2023)

An accelerated first-order regularized momentum descent ascent algorithm for stochastic nonconvex-concave minimax problems
by: Zhang, Huiling, et al.
Published: (2023)

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

On the efficient computation of proximal operators of affine-constrained nonconvex functions
by: Hou, Di, et al.
Published: (2026)

Coordinate descent methods beyond smoothness and separability
by: Chorobura, Flavia, et al.
Published: (2024)

On the convergence analysis of the decentralized projected gradient descent method
by: Choi, Woocheol, et al.
Published: (2023)

Minimizing smooth Kurdyka-Łojasiewicz functions via generalized descent methods: Convergence rate and complexity
by: Ahookhosh, Masoud, et al.
Published: (2025)

Stochastic homogenization of nonconvex unbounded integral functionals with generalized Orlicz growth
by: Aruta, Davide, et al.
Published: (2026)

Global convergence of a BFGS-type algorithm for nonconvex multiobjective optimization problems
by: Prudente, L. F., et al.
Published: (2023)

Steepest geometric descent for regularized quasiconvex functions
by: Daniilidis, Aris, et al.
Published: (2023)

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

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

Frank-Wolfe-type methods for a class of nonconvex inequality-constrained problems
by: Zeng, Liaoyuan, et al.
Published: (2021)

Active-set Newton-MR methods for nonconvex optimization problems with bound constraints
by: Birgin, Ernesto G., et al.
Published: (2025)

Almost sure convergence of stochastic Hamiltonian descent methods
by: Williamson, Måns, et al.
Published: (2024)

Mirror descent method for stochastic multi-objective optimization
by: Yang, Linxi, et al.
Published: (2024)

Random coordinate descent methods for nonseparable composite optimization
by: Chorobura, Flavia, et al.
Published: (2022)

Improvements to steepest descent method for multi-objective optimization
by: Chen, Wang, et al.
Published: (2023)

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

Newton and interior-point methods for (constrained) nonconvex-nonconcave minmax optimization with stability and instability guarantees
by: Chinchilla, Raphael, et al.
Published: (2022)

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

Complexity of a linearized augmented Lagrangian method for nonconvex minimization with nonlinear equality constraints
by: Bourkhissi, Lahcen El, et al.
Published: (2023)

A Busemann hybrid projection-proximal point algorithm for optimization problems on Hadamard manifolds
by: Millán, R. Díaz, et al.
Published: (2026)

The inexact power augmented Lagrangian method for constrained nonconvex optimization
by: Bodard, Alexander, et al.
Published: (2024)

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