A Novel First-order Method with Event-driven Objective Evaluations
Fuente:
arXiv
Guardado en:
| Autores principales: | Varner, Christian, Patel, Vivak |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
A Novel Gradient Methodology with Economical Objective Function Evaluations for Data Science Applications
por: Varner, Christian, et al.
Publicado: (2023)
por: Varner, Christian, et al.
Publicado: (2023)
The Challenges of Optimization For Data Science
por: Varner, Christian, et al.
Publicado: (2024)
por: Varner, Christian, et al.
Publicado: (2024)
An Augmented Lagrangian Method for Training Recurrent Neural Networks
por: Wang, Yue, et al.
Publicado: (2024)
por: Wang, Yue, et al.
Publicado: (2024)
A Vectorized Positive Semidefinite Penalty Method for Unconstrained Binary Quadratic Programming
por: Huo, Xinyue, et al.
Publicado: (2024)
por: Huo, Xinyue, et al.
Publicado: (2024)
Distributed Gradient-Regularized Newton Method: Scheduled Consensus and O(epsilon^{-1}) Global Iteration Complexity
por: Hu, Wei, et al.
Publicado: (2026)
por: Hu, Wei, et al.
Publicado: (2026)
Objective-Function Free Multi-Objective Optimization: Rate of Convergence and Performance of an Adagrad-like algorithm
por: De Santis, Marianna, et al.
Publicado: (2026)
por: De Santis, Marianna, et al.
Publicado: (2026)
Global Optimization with A Power-Transformed Objective and Gaussian Smoothing
por: Xu, Chen
Publicado: (2024)
por: Xu, Chen
Publicado: (2024)
Recent Advances in Non-convex Smoothness Conditions and Applicability to Deep Linear Neural Networks
por: Patel, Vivak, et al.
Publicado: (2024)
por: Patel, Vivak, et al.
Publicado: (2024)
Inexact Riemannian Gradient Descent Method for Nonconvex Optimization
por: Zhou, Juan, et al.
Publicado: (2024)
por: Zhou, Juan, et al.
Publicado: (2024)
The Augmented Lagrangian Methods: Overview and Recent Advances
por: Deng, Kangkang, et al.
Publicado: (2025)
por: Deng, Kangkang, et al.
Publicado: (2025)
Riemannian Adaptive Regularized Newton Methods with Hölder Continuous Hessians
por: Zhang, Chenyu, et al.
Publicado: (2023)
por: Zhang, Chenyu, et al.
Publicado: (2023)
Distributed accelerated proximal conjugate gradient methods for multi-agent constrained optimization problems
por: Gebrie, Anteneh Getachew
Publicado: (2023)
por: Gebrie, Anteneh Getachew
Publicado: (2023)
A Sequential Quadratic Programming Method for Optimization with Stochastic Objective Functions, Deterministic Inequality Constraints and Robust Subproblems
por: Qiu, Songqiang, et al.
Publicado: (2023)
por: Qiu, Songqiang, et al.
Publicado: (2023)
Preconditioned Proximal Gradient Methods with Conjugate Momentum: A Subspace Perspective
por: Chen, Jian, et al.
Publicado: (2026)
por: Chen, Jian, et al.
Publicado: (2026)
On the asymptotic behavior of a higher-order extrapolation primal-dual interior-point method for nonlinear programming
por: Heeman, Pim, et al.
Publicado: (2025)
por: Heeman, Pim, et al.
Publicado: (2025)
BUP-TR: Bayesian Underdetermined Projection Trust-Region Methods for Derivative-Free Optimization
por: Hu, Wei, et al.
Publicado: (2026)
por: Hu, Wei, et al.
Publicado: (2026)
Proximal Gradient Descent Ascent Methods for Nonsmooth Nonconvex-Concave Minimax Problems on Riemannian Manifolds
por: Xie, Xiyuan, et al.
Publicado: (2025)
por: Xie, Xiyuan, et al.
Publicado: (2025)
Nonlinear Derivative-free Constrained Optimization with a Penalty-Interior Point Method and Direct Search
por: Brilli, Andrea, et al.
Publicado: (2024)
por: Brilli, Andrea, et al.
Publicado: (2024)
A Barrier-Metric First-Order Method for Linearly Constrained Bilevel Optimization
por: Hong, Tenglong, et al.
Publicado: (2026)
por: Hong, Tenglong, et al.
Publicado: (2026)
Delayed Feedback in Online Non-Convex Optimization: A Non-Stationary Approach with Applications
por: Lara, Felipe, et al.
Publicado: (2024)
por: Lara, Felipe, et al.
Publicado: (2024)
Convergence of iterates and improved rates for accelerated augmented Lagrangian methods for linearly constrained convex optimization
por: He, Xin, et al.
Publicado: (2026)
por: He, Xin, et al.
Publicado: (2026)
A descent method for nonsmooth multiobjective optimization problems on Riemannian manifolds
por: Tang, Chunming, et al.
Publicado: (2023)
por: Tang, Chunming, et al.
Publicado: (2023)
Preconditioned subgradient method for composite optimization: overparameterization and fast convergence
por: Díaz, Mateo, et al.
Publicado: (2025)
por: Díaz, Mateo, et al.
Publicado: (2025)
A Stochastic Implicit Proximal Point Algorithm for Solving Linearly Constrained Stochastic Minimax Problems
por: Zhu, Kehan, et al.
Publicado: (2026)
por: Zhu, Kehan, et al.
Publicado: (2026)
Parameter-Free Accelerated Quasi-Newton Method for Nonconvex Optimization
por: Marumo, Naoki
Publicado: (2025)
por: Marumo, Naoki
Publicado: (2025)
A Proximal-Gradient Method for Constrained Optimization
por: Dai, Yutong, et al.
Publicado: (2024)
por: Dai, Yutong, et al.
Publicado: (2024)
New gradient methods with 3 dimensional quadratic termination
por: Xie, Yixin, et al.
Publicado: (2026)
por: Xie, Yixin, et al.
Publicado: (2026)
Existence of augmented Lagrange multipliers: reduction to exact penalty functions and localization principle
por: Dolgopolik, M. V.
Publicado: (2018)
por: Dolgopolik, M. V.
Publicado: (2018)
Improved Penalty Function Approaches for Optimization Problems with General Orthogonality
por: Zhang, Yongshen, et al.
Publicado: (2026)
por: Zhang, Yongshen, et al.
Publicado: (2026)
Augmented Lagrangian Functions for Cone Constrained Optimization: the Existence of Global Saddle Points and Exact Penalty Property
por: Dolgopolik, M. V.
Publicado: (2017)
por: Dolgopolik, M. V.
Publicado: (2017)
A practical randomized trust-region method to escape saddle points in high dimension
por: Dragomir, Radu-Alexandru, et al.
Publicado: (2026)
por: Dragomir, Radu-Alexandru, et al.
Publicado: (2026)
A Proximal-Gradient Method for Solving Regularized Optimization Problems with General Constraints
por: Curtis, Frank E., et al.
Publicado: (2025)
por: Curtis, Frank E., et al.
Publicado: (2025)
Technical results on the convergence of quasi-Newton methods for nonsmooth optimization
por: Gebken, Bennet
Publicado: (2025)
por: Gebken, Bennet
Publicado: (2025)
Stochastic optimization over proximally smooth sets
por: Davis, Damek, et al.
Publicado: (2020)
por: Davis, Damek, et al.
Publicado: (2020)
Gradient descent with adaptive stepsize converges (nearly) linearly under fourth-order growth
por: Davis, Damek, et al.
Publicado: (2024)
por: Davis, Damek, et al.
Publicado: (2024)
A New Two-dimensional Model-based Subspace Method for Large-scale Unconstrained Derivative-free Optimization: 2D-MoSub
por: Xie, Pengcheng, et al.
Publicado: (2023)
por: Xie, Pengcheng, et al.
Publicado: (2023)
A MINRES-based Linesearch Algorithm for Nonconvex Optimization with Non-positive Curvature Detection
por: Zeng, Hanfeng, et al.
Publicado: (2026)
por: Zeng, Hanfeng, et al.
Publicado: (2026)
Power Homotopy for Zeroth-Order Non-Convex Optimizations
por: Xu, Chen
Publicado: (2025)
por: Xu, Chen
Publicado: (2025)
A modified exact penalty approach for general constrained $\ell_0$-sparse optimization problems
por: Kanzow, Christian, et al.
Publicado: (2025)
por: Kanzow, Christian, et al.
Publicado: (2025)
Convergence-Guaranteed Algorithms for l1/2-Regularized Quadratic Programs with Assignment Constraints
por: Xie, Lijun, et al.
Publicado: (2025)
por: Xie, Lijun, et al.
Publicado: (2025)
Ejemplares similares
-
A Novel Gradient Methodology with Economical Objective Function Evaluations for Data Science Applications
por: Varner, Christian, et al.
Publicado: (2023) -
The Challenges of Optimization For Data Science
por: Varner, Christian, et al.
Publicado: (2024) -
An Augmented Lagrangian Method for Training Recurrent Neural Networks
por: Wang, Yue, et al.
Publicado: (2024) -
A Vectorized Positive Semidefinite Penalty Method for Unconstrained Binary Quadratic Programming
por: Huo, Xinyue, et al.
Publicado: (2024) -
Distributed Gradient-Regularized Newton Method: Scheduled Consensus and O(epsilon^{-1}) Global Iteration Complexity
por: Hu, Wei, et al.
Publicado: (2026)