An arc-search BFGS algorithm for unconstrained nonlinear optimization problems

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Yang, Yaguang
Format:	Preprint
Published:	2026
Subjects:	Optimization and Control 90C30
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A computationally efficient arc-search interior-point algorithm for nonlinear constrained optimization
by: Yang, Yaguang
Published: (2024)

A polynomial time infeasible interior-point arc-search algorithm for convex optimization
by: Yang, Yaguang
Published: (2022)

A robust BFGS algorithm for unconstrained nonlinear optimization problems
by: Yang, Yaguang
Published: (2012)

A globalization of L-BFGS and the Barzilai-Borwein method for nonconvex unconstrained optimization
by: Mannel, Florian
Published: (2024)

Efficient globalization of heavy-ball type methods for unconstrained optimization based on curve searches
by: Donnini, Federica, et al.
Published: (2025)

A novel numerical method tailored for unconstrained optimization problems
by: Li, Lin, et al.
Published: (2025)

Second-order sequential optimality conditions for nonlinear semidefinite optimization problems
by: Li, Huimin, et al.
Published: (2025)

Inexact Restoration via random models for unconstrained noisy optimization
by: Morini, Benedetta, et al.
Published: (2024)

Modified limited memory BFGS with displacement aggregation and its application to the largest eigenvalue problem
by: Sahu, Manish Kumar, et al.
Published: (2023)

A second-order sequential optimality condition for nonlinear second-order cone programming problems
by: Fukuda, Ellen H., et al.
Published: (2023)

A heavy-ball type curve search method for smooth convexly constrained optimization
by: Donnini, Federica, et al.
Published: (2026)

A four-operator splitting algorithm for nonconvex and nonsmooth optimization
by: Alcantara, Jan Harold, et al.
Published: (2024)

Projection-based curve pattern search for black-box optimization over smooth convex sets
by: Jia, Xiaoxi, et al.
Published: (2025)

Duality-based single-level reformulations of bilevel optimization problems
by: Dempe, Stephan, et al.
Published: (2024)

On convergence of a $q$-random coordinate constrained algorithm for non-convex problems
by: Ghaffari-Hadigheh, Alireza, et al.
Published: (2022)

A min-max reformulation and proximal algorithms for a class of structured nonsmooth fractional optimization problems
by: Zhou, Junpeng, et al.
Published: (2025)

A double-pivot degenerate-robust simplex algorithm for linear programming
by: Yang, Yaguang, et al.
Published: (2021)

Adaptive direct search algorithms for constrained optimization
by: Audet, Charles, et al.
Published: (2025)

A structured L-BFGS method and its application to inverse problems
by: Mannel, Florian, et al.
Published: (2023)

An efficient penalty decomposition algorithm for minimization over sparse symmetric sets
by: Mousavi, Ahmad, et al.
Published: (2026)

Decision-focused predictions via pessimistic bilevel optimization: complexity and algorithms
by: Bucarey, Víctor, et al.
Published: (2023)

On optimal LISA orbit design
by: Yang, Yaguang
Published: (2025)

An interior point method for nonlinear constrained derivative-free optimization
by: Brilli, Andrea, et al.
Published: (2021)

A polynomially solvable case of unconstrained (-1,1)-quadratic fractional optimization
by: Yang, Meijia, et al.
Published: (2024)

On the solution set of semi-infinite tensor complementarity problem
by: Deb, R., et al.
Published: (2023)

Two trust region type algorithms for solving nonconvex-strongly concave minimax problems
by: Yao, Tongliang, et al.
Published: (2024)

A linesearch-based derivative-free method for noisy black-box problems
by: De Santis, Alberto, et al.
Published: (2025)

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

Optimality conditions for problems over symmetric cones and a simple augmented Lagrangian method
by: Lourenço, Bruno F., et al.
Published: (2017)

Mixed-integer linearity in nonlinear optimization: a trust region approach
by: De Marchi, Alberto
Published: (2023)

A nonsmooth Frank-Wolfe algorithm through a dual cutting-plane approach
by: Mazanti, Guilherme, et al.
Published: (2024)

On the facet pivot simplex method for linear programming
by: Yang, Yaguang
Published: (2021)

Surrogate-based categorical neighborhoods for mixed-variable blackbox optimization
by: Audet, Charles, et al.
Published: (2026)

Bound tightening in lifted formulations: (sub)solver-dependent impact on performance in RLT-based algorithms
by: González-Díaz, Julio, et al.
Published: (2025)

An accelerated primal-dual flow for linearly constrained multiobjective optimization
by: Luo, Hao, et al.
Published: (2025)

Nonsmooth exact penalty methods for equality-constrained optimization: complexity and implementation
by: Diouane, Youssef, et al.
Published: (2024)

Worst-case complexity analysis of derivative-free methods for multi-objective optimization
by: Liuzzi, Giampaolo, et al.
Published: (2025)

CatMADS: Mesh Adaptive Direct Search for constrained blackbox optimization with categorical variables
by: Audet, Charles, et al.
Published: (2025)

A preconditioned augmented Lagrangian method for solving semidefinite programming problems
by: Tang, Tianyun, et al.
Published: (2026)

Solving nonconvex optimization problems via a second order dynamical system with unbounded damping
by: László, Szilárd Csaba
Published: (2025)