Image de couverture de livre

Strongly-polynomial time and validation analysis of policy gradient methods

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Ju, Caleb, Lan, Guanghui
Format:	Preprint
Publié:	2024
Sujets:	Machine Learning Artificial Intelligence Data Structures and Algorithms Optimization and Control 49K45, 49M05, 90C05, 90C26, 90C40, 90C46
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Finding Short Paths on Simple Polytopes
par: Black, Alexander E., et autres
Publié: (2026)

Optimization Problems with Nearly Convex Objective Functions and Nearly Convex Constraint Sets
par: Thieu, Nguyen Nang, et autres
Publié: (2026)

Augmented Lagrangian methods for fully convex composite optimization
par: De Marchi, Alberto, et autres
Publié: (2025)

Lipschitz upper semicontinuity of linear inequality systems under full perturbations
par: Camacho, Jesús, et autres
Publié: (2025)

Nonsmooth convex-concave saddle point problems with cardinality penalties
par: Bian, Wei, et autres
Publié: (2024)

Sublinear Scalarizations for Proper and Approximate Proper Efficient Points in Nonconvex Vector Optimization
par: García-Castaño, Fernando, et autres
Publié: (2024)

Trust-Region Method for Optimization of Set-Valued Maps Given by Finitely Many Functions
par: Ghosh, Suprova, et autres
Publié: (2025)

On the facet pivot simplex method for linear programming
par: Yang, Yaguang
Publié: (2021)

ItsOPT: An inexact two-level smoothing framework for nonconvex optimization via high-order Moreau envelope
par: Kabgani, Alireza, et autres
Publié: (2024)

ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization
par: Kabgani, Alireza, et autres
Publié: (2025)

A truncated epsilon-subdifferential method for global DC optimization
par: Bagirov, Adil M., et autres
Publié: (2025)

Asymptotic Convergence and Stability of Adaptive Gradient Methods in Smooth Non-convex Optimization
par: Jin, Ruinan, et autres
Publié: (2026)

First- and Second-Order Stochastic Adaptive Regularization with Cubics: High Probability Iteration and Sample Complexity
par: Scheinberg, Katya, et autres
Publié: (2023)

QPALM: A Proximal Augmented Lagrangian Method for Nonconvex Quadratic Programs
par: Hermans, Ben, et autres
Publié: (2020)

Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints
par: Berahas, Albert S., et autres
Publié: (2025)

On the Convergence and Complexity of Proximal Gradient and Accelerated Proximal Gradient Methods under Adaptive Gradient Estimation
par: Bollapragada, Raghu, et autres
Publié: (2025)

A new problem qualification based on approximate KKT conditions for Lipschitzian optimization with application to bilevel programming
par: Käming, Isabella, et autres
Publié: (2024)

First-order majorization-minimization meets high-order majorant: Boosted inexact high-order forward-backward method
par: Kabgani, Alireza, et autres
Publié: (2025)

Flexible block-iterative analysis for the Frank-Wolfe algorithm
par: Braun, Gábor, et autres
Publié: (2024)

A Refined Proximal Algorithm for Nonconvex Multiobjective Optimization in Hilbert Spaces
par: Bento, G. C., et autres
Publié: (2024)

Variational analysis of unbounded and discontinuous generalized eigenvalue functions with application to topology optimization
par: Nishioka, Akatsuki, et autres
Publié: (2024)

Nonmonotone subgradient methods based on a local descent lemma
par: Aragón-Artacho, Francisco J., et autres
Publié: (2025)

A new geometric approach to multiobjective linear programming problems
par: Kaci, Mustapha, et autres
Publié: (2022)

A double-pivot degenerate-robust simplex algorithm for linear programming
par: Yang, Yaguang, et autres
Publié: (2021)

Non-Convex Self-Concordant Functions: Practical Algorithms and Complexity Analysis
par: Goldfarb, Donald, et autres
Publié: (2025)

Riemannian Trust Region Methods for SC$^1$ Minimization
par: Zhang, Chenyu, et autres
Publié: (2023)

Inexact Limited Memory Bundle Method
par: Lampainen, Jenni, et autres
Publié: (2026)

A Cubic Regularization Method for Multiobjective Optimization
par: Gonçalves, Douglas S., et autres
Publié: (2025)

Alternating Gradient-Type Algorithm for Bilevel Optimization with Inexact Lower-Level Solutions via Moreau Envelope-based Reformulation
par: Bai, Xiaoning, et autres
Publié: (2024)

A General Recipe for Parameter-Free Nonconvex Optimization via Higher-Order Regularization
par: Marumo, Naoki, et autres
Publié: (2026)

A full splitting algorithm for fractional programs with structured numerators and denominators
par: Boţ, Radu Ioan, et autres
Publié: (2023)

Inexact Proximal Point Algorithms for Zeroth-Order Global Optimization
par: Zhang, Minxin, et autres
Publié: (2024)

A Single-loop Proximal Subgradient Algorithm for A Class Structured Fractional Programs
par: Han, Deren, et autres
Publié: (2025)

MGProx: A nonsmooth multigrid proximal gradient method with adaptive restriction for strongly convex optimization
par: Ang, Andersen, et autres
Publié: (2023)

A modified exact penalty approach for general constrained $\ell_0$-sparse optimization problems
par: Kanzow, Christian, et autres
Publié: (2025)

Optimality conditions via exact penalty functions
par: Ivanov, Vsevolod Ivanov
Publié: (2026)

Strong metric (sub)regularity in optimal control
par: Jork, Nicolai A., et autres
Publié: (2024)

Projected gradient descent accumulates at Bouligand stationary points
par: Olikier, Guillaume, et autres
Publié: (2024)

Generalized Steepest Descent Methods on Riemannian Manifolds and Hilbert Spaces: Convergence Analysis and Stochastic Extensions
par: A., Rashid, et autres
Publié: (2025)

Measuring dissimilarity between convex cones by means of max-min angles
par: de Oliveira, Welington, et autres
Publié: (2025)