Imagen de Portada

A line search framework with restarting for noisy optimization problems

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Berahas, Albert S., O'Neill, Michael J., Royer, Clément W.
Formato:	Preprint
Publicado:	2025
Materias:	Optimization and Control
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Computing optimal policies for managing inventories with noisy observations
por: Feinberg, Eugene, et al.
Publicado: (2025)

Direct-search methods for decentralized blackbox optimization
por: Bergou, El Houcine, et al.
Publicado: (2025)

Complexity guarantees and polling strategies for Riemannian direct-search methods
por: Cavarretta, Bastien, et al.
Publicado: (2025)

A Sequential Cubic Programming Method with Second-Order Complexity Guarantees for Equality Constrained Optimization
por: Dimou, Nikos, et al.
Publicado: (2026)

Optimistic Noise-Aware Sequential Quadratic Programming for Equality Constrained Optimization with Rank-Deficient Jacobians
por: Berahas, Albert S., et al.
Publicado: (2025)

Negative Curvature Methods with High-Probability Complexity Guarantees for Stochastic Nonconvex Optimization
por: Berahas, Albert S., et al.
Publicado: (2026)

Exploiting Negative Curvature in Conjunction with Adaptive Sampling: Theoretical Results and a Practical Algorithm
por: Berahas, Albert S., et al.
Publicado: (2024)

Modified Line Search Sequential Quadratic Methods for Equality-Constrained Optimization with Unified Global and Local Convergence Guarantees
por: Berahas, Albert S., et al.
Publicado: (2024)

A Gradient Sampling Algorithm for Noisy Nonsmooth Optimization
por: Berahas, Albert S., et al.
Publicado: (2026)

An accelerated gradient method with adaptive restart for convex multiobjective optimization problems
por: Luo, Hao, et al.
Publicado: (2025)

A Sequential Quadratic Programming Method with High Probability Complexity Bounds for Nonlinear Equality Constrained Stochastic Optimization
por: Berahas, Albert S., et al.
Publicado: (2023)

Riemannian trust-region methods for strict saddle functions with complexity guarantees
por: Goyens, Florentin, et al.
Publicado: (2024)

Polling Set Construction and Worst-Case Complexity for Direct Search under Polyhedral Convex Constraints
por: Roberts, Lindon, et al.
Publicado: (2026)

Complexity analysis of regularization methods for implicitly constrained least squares
por: Onwunta, Akwum, et al.
Publicado: (2023)

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

Direct-search methods in the year 2025: Theoretical guarantees and algorithmic paradigms
por: Dzahini, K. J., et al.
Publicado: (2024)

Full-Low Evaluation Methods For Bound and Linearly Constrained Derivative-Free Optimization
por: Royer, Clément W., et al.
Publicado: (2023)

Conjugate gradient methods without line search for multiobjective optimization
por: Chen, Wang, et al.
Publicado: (2023)

A 140 line MATLAB code for topology optimization problems with probabilistic parameters
por: Uihlein, Andrian, et al.
Publicado: (2025)

Modified Armijo line search in optimization on Riemannian submanifolds with reduced computational cost
por: Sato, Hiroyuki, et al.
Publicado: (2023)

A simple uniformly optimal method without line search for convex optimization
por: Li, Tianjiao, et al.
Publicado: (2023)

Unifying restart accelerated gradient and proximal bundle methods
por: Liang, Jiaming
Publicado: (2025)

An effective subgradient algorithm via Mifflin's line search for nonsmooth nonconvex multiobjective optimization
por: Maleknia, Morteza, et al.
Publicado: (2024)

Preference-based optimization from noisy pairwise comparisons
por: Wang, Siyi, et al.
Publicado: (2025)

Complexity of an inexact stochastic SQP algorithm for equality constrained optimization
por: O'Neill, Michael J., et al.
Publicado: (2026)

Solving separable convex optimization problems: Faster prediction-correction framework
por: Zhang, Tao, et al.
Publicado: (2023)

Set-valued regression and cautious suboptimization: From noisy data to optimality
por: Eising, Jaap, et al.
Publicado: (2025)

A Two Stepsize SQP Method for Nonlinear Equality Constrained Stochastic Optimization
por: O'Neill, Michael J.
Publicado: (2024)

Worst-case analysis of restarted primal-dual hybrid gradient on totally unimodular linear programs
por: Hinder, Oliver
Publicado: (2023)

Second-order Information Promotes Mini-Batch Robustness in Variance-Reduced Gradients
por: Garg, Sachin, et al.
Publicado: (2024)

Sample-Cluster-Select: A new framework to obtain diverse approximate solutions of combinatorial optimization problems
por: Hashimoto, Susumu, et al.
Publicado: (2025)

A turnpike property in an eigenvalue optimization problem
por: Kaminer, Adam, et al.
Publicado: (2026)

An arc-search BFGS algorithm for unconstrained nonlinear optimization problems
por: Yang, Yaguang
Publicado: (2026)

A two-stage search framework for constrained multi-gradient descent
por: Lei, Yuan-Zheng, et al.
Publicado: (2025)

Towards faster first order methods: A continuous-time model to interpolate between speed and function value restart
por: Maulén, Juan José, et al.
Publicado: (2025)

Second-order optimality conditions for optimization problems with generalized equation constraints
por: Benko, M., et al.
Publicado: (2026)

Efficient search strategies for constrained multiobjective blackbox optimization
por: Digabel, Sébastien Le, et al.
Publicado: (2025)

A unified optimal control framework: time-optimal control and stochastic optimal control
por: Yang, Shuzhen
Publicado: (2025)

Consistent inverse optimal control for infinite time-horizon discounted nonlinear systems under noisy observations
por: Wang, Ziliang, et al.
Publicado: (2026)

An application of the mean motion problem to time-optimal control
por: Dalin, Omri, et al.
Publicado: (2025)