A \(J\)-symmetric quasi-Newton method for minimax problems

DOI10.1007/s10107-023-01957-1arXiv2202.02279OpenAlexW4366488524MaRDI QIDQ6120841

Azam Asl, Haihao Lu, Jinwen Yang

Publication date: 21 February 2024

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2202.02279

zbMATH Keywords

minimax optimizationsuperlinear convergencequasi-Newton methodtrust region\(J\)-symmetric

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Optimality conditions for minimax problems (49K35) Numerical methods for variational inequalities and related problems (65K15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm
• Primal-dual-infeasible Newton approach for the analytic center deep-cutting plane method
• Proximal quasi-Newton methods for nondifferentiable convex optimization
• Complexity analysis of the analytic center cutting plane method that uses multiple cuts
• On the superlinear convergence of the variable metric proximal point algorithm using Broyden and BFGS matrix secant updating
• A cutting plane algorithm for convex programming that uses analytic centers
• Complexity estimates of some cutting plane methods based on the analytic barrier
• A first-order primal-dual algorithm for convex problems with applications to imaging
• An \(O(s^r)\)-resolution ODE framework for understanding discrete-time algorithms and applications to the linear convergence of minimax problems
• Fast Curvature Matrix-Vector Products for Second-Order Gradient Descent
• Numerical solution of saddle point problems
• Global Convergence of a Cass of Quasi-Newton Methods on Convex Problems
• Variable Metric Method for Minimization
• On the Global Convergence of Broyden's Method
• Quasi-Newton Methods, Motivation and Theory
• Monotone Operators and the Proximal Point Algorithm
• A Variable Metric Proximal Point Algorithm for Monotone Operators
• A globally convergent BFGS method for pseudo-monotone variational inequality problems
• A Preconditioner for Generalized Saddle Point Problems
• Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
• Four Good Reasons to Use an Interior Point Solver Within a MIP Solver
• Structured tools for structured matrices
• On the Local and Superlinear Convergence of Quasi-Newton Methods
• A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
• Analysis of the gradient method with an Armijo–Wolfe line search on a class of non-smooth convex functions
• A Class of Methods for Solving Nonlinear Simultaneous Equations
• A Rapidly Convergent Descent Method for Minimization
• A Family of Variable-Metric Methods Derived by Variational Means
• A new approach to variable metric algorithms
• The Convergence of Single-Rank Quasi-Newton Methods
• Conditioning of Quasi-Newton Methods for Function Minimization
• A New Algorithm for Unconstrained Optimization

This page was built for publication: A \(J\)-symmetric quasi-Newton method for minimax problems