Copertina

A Novel First-order Method with Event-driven Objective Evaluations

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Varner, Christian, Patel, Vivak
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Optimization and Control Computation 90C30, 65K05, 68T09
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

A Novel Gradient Methodology with Economical Objective Function Evaluations for Data Science Applications
di: Varner, Christian, et al.
Pubblicazione: (2023)

The Challenges of Optimization For Data Science
di: Varner, Christian, et al.
Pubblicazione: (2024)

An Augmented Lagrangian Method for Training Recurrent Neural Networks
di: Wang, Yue, et al.
Pubblicazione: (2024)

A Vectorized Positive Semidefinite Penalty Method for Unconstrained Binary Quadratic Programming
di: Huo, Xinyue, et al.
Pubblicazione: (2024)

Distributed Gradient-Regularized Newton Method: Scheduled Consensus and O(epsilon^{-1}) Global Iteration Complexity
di: Hu, Wei, et al.
Pubblicazione: (2026)

Objective-Function Free Multi-Objective Optimization: Rate of Convergence and Performance of an Adagrad-like algorithm
di: De Santis, Marianna, et al.
Pubblicazione: (2026)

Global Optimization with A Power-Transformed Objective and Gaussian Smoothing
di: Xu, Chen
Pubblicazione: (2024)

Recent Advances in Non-convex Smoothness Conditions and Applicability to Deep Linear Neural Networks
di: Patel, Vivak, et al.
Pubblicazione: (2024)

Inexact Riemannian Gradient Descent Method for Nonconvex Optimization
di: Zhou, Juan, et al.
Pubblicazione: (2024)

The Augmented Lagrangian Methods: Overview and Recent Advances
di: Deng, Kangkang, et al.
Pubblicazione: (2025)

Riemannian Adaptive Regularized Newton Methods with Hölder Continuous Hessians
di: Zhang, Chenyu, et al.
Pubblicazione: (2023)

Distributed accelerated proximal conjugate gradient methods for multi-agent constrained optimization problems
di: Gebrie, Anteneh Getachew
Pubblicazione: (2023)

A Sequential Quadratic Programming Method for Optimization with Stochastic Objective Functions, Deterministic Inequality Constraints and Robust Subproblems
di: Qiu, Songqiang, et al.
Pubblicazione: (2023)

Preconditioned Proximal Gradient Methods with Conjugate Momentum: A Subspace Perspective
di: Chen, Jian, et al.
Pubblicazione: (2026)

On the asymptotic behavior of a higher-order extrapolation primal-dual interior-point method for nonlinear programming
di: Heeman, Pim, et al.
Pubblicazione: (2025)

BUP-TR: Bayesian Underdetermined Projection Trust-Region Methods for Derivative-Free Optimization
di: Hu, Wei, et al.
Pubblicazione: (2026)

Proximal Gradient Descent Ascent Methods for Nonsmooth Nonconvex-Concave Minimax Problems on Riemannian Manifolds
di: Xie, Xiyuan, et al.
Pubblicazione: (2025)

Nonlinear Derivative-free Constrained Optimization with a Penalty-Interior Point Method and Direct Search
di: Brilli, Andrea, et al.
Pubblicazione: (2024)

A Barrier-Metric First-Order Method for Linearly Constrained Bilevel Optimization
di: Hong, Tenglong, et al.
Pubblicazione: (2026)

Delayed Feedback in Online Non-Convex Optimization: A Non-Stationary Approach with Applications
di: Lara, Felipe, et al.
Pubblicazione: (2024)

Convergence of iterates and improved rates for accelerated augmented Lagrangian methods for linearly constrained convex optimization
di: He, Xin, et al.
Pubblicazione: (2026)

A descent method for nonsmooth multiobjective optimization problems on Riemannian manifolds
di: Tang, Chunming, et al.
Pubblicazione: (2023)

Preconditioned subgradient method for composite optimization: overparameterization and fast convergence
di: Díaz, Mateo, et al.
Pubblicazione: (2025)

A Stochastic Implicit Proximal Point Algorithm for Solving Linearly Constrained Stochastic Minimax Problems
di: Zhu, Kehan, et al.
Pubblicazione: (2026)

Parameter-Free Accelerated Quasi-Newton Method for Nonconvex Optimization
di: Marumo, Naoki
Pubblicazione: (2025)

A Proximal-Gradient Method for Constrained Optimization
di: Dai, Yutong, et al.
Pubblicazione: (2024)

New gradient methods with 3 dimensional quadratic termination
di: Xie, Yixin, et al.
Pubblicazione: (2026)

Existence of augmented Lagrange multipliers: reduction to exact penalty functions and localization principle
di: Dolgopolik, M. V.
Pubblicazione: (2018)

Improved Penalty Function Approaches for Optimization Problems with General Orthogonality
di: Zhang, Yongshen, et al.
Pubblicazione: (2026)

Augmented Lagrangian Functions for Cone Constrained Optimization: the Existence of Global Saddle Points and Exact Penalty Property
di: Dolgopolik, M. V.
Pubblicazione: (2017)

A practical randomized trust-region method to escape saddle points in high dimension
di: Dragomir, Radu-Alexandru, et al.
Pubblicazione: (2026)

A Proximal-Gradient Method for Solving Regularized Optimization Problems with General Constraints
di: Curtis, Frank E., et al.
Pubblicazione: (2025)

Technical results on the convergence of quasi-Newton methods for nonsmooth optimization
di: Gebken, Bennet
Pubblicazione: (2025)

Stochastic optimization over proximally smooth sets
di: Davis, Damek, et al.
Pubblicazione: (2020)

Gradient descent with adaptive stepsize converges (nearly) linearly under fourth-order growth
di: Davis, Damek, et al.
Pubblicazione: (2024)

A New Two-dimensional Model-based Subspace Method for Large-scale Unconstrained Derivative-free Optimization: 2D-MoSub
di: Xie, Pengcheng, et al.
Pubblicazione: (2023)

A MINRES-based Linesearch Algorithm for Nonconvex Optimization with Non-positive Curvature Detection
di: Zeng, Hanfeng, et al.
Pubblicazione: (2026)

Power Homotopy for Zeroth-Order Non-Convex Optimizations
di: Xu, Chen
Pubblicazione: (2025)

A modified exact penalty approach for general constrained $\ell_0$-sparse optimization problems
di: Kanzow, Christian, et al.
Pubblicazione: (2025)

Convergence-Guaranteed Algorithms for l1/2-Regularized Quadratic Programs with Assignment Constraints
di: Xie, Lijun, et al.
Pubblicazione: (2025)