Nonmonotone line search algorithm for constrained minimax problems
From MaRDI portal
Recommendations
Cites work
- A constrained min-max algorithm for rival models of the same economic system
- A globally convergent method for nonlinear programming
- A Nonmonotone Line Search Technique for Newton’s Method
- A surperlinearly convergent algorithm for constrained optimization problems
- An Algorithm for the Inequality-Constrained Discrete Min--Max Problem
- Avoiding the Maratos Effect by Means of a Nonmonotone Line Search I. General Constrained Problems
- Globally convergent variable metric method for convex nonsmooth unconstrained minimization
- Nonmonotone line search for minimax problems
- The watchdog technique for forcing convergence in algorithms for constrained optimization
Cited in
(32)- Reference variable methods of solving min-Max optimization problems
- A sequential quadratically constrained quadratic programming method for unconstrained minimax problems
- On the rate of convergence of two minimax algorithms
- Nonmonotone line search for minimax problems
- A QP-free algorithm for finite minimax problems
- Improved filter-SQP algorithm with active set for constrained minimax problems
- A nonmonotonic hybrid algorithm for min-max problem
- Feasible generalized monotone line search SQP algorithm for nonlinear minimax problems with inequality constraints
- Quadratically constraint quadratical algorithm model for nonlinear minimax problems
- An adaptive nonmonotone trust-region method with curvilinear search for minimax problem
- A new superlinearly convergent SQP algorithm for nonlinear minimax problems
- The optimization technique for solving a class of non-differentiable programming based on neural network method
- scientific article; zbMATH DE number 5926088 (Why is no real title available?)
- A Nonlinear Lagrange Algorithm for Minimax Problems with General Constraints
- scientific article; zbMATH DE number 4152164 (Why is no real title available?)
- Generalized monotone line search SQP algorithm for constrained minimax problems
- A hybrid algorithm for linearly constrained minimax problems
- A nonmonotone line search slackness technique for unconstrained optimization
- Avoiding the Maratos Effect by Means of a Nonmonotone Line Search. II. Inequality Constrained Problems—Feasible Iterates
- A nonlinear augmented Lagrangian for constrained minimax problems
- Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems
- Cost approximation algorithms with nonmonotone line searches for a general class of nonlinear programs
- A New Nonmonotone Linesearch SQP Algorithm for Unconstrained Minimax Problem
- A unified study of necessary and sufficient optimality conditions for minimax and Chebyshev problems with cone constraints
- A superlinearly convergent norm-relaxed method of quasi-strongly sub-feasible direction for inequality constrained minimax problems
- A sequential quadratic programming algorithm for nonlinear minimax problems
- On the accurate identification of active set for constrained minimax problems
- Nonmonotone algorithm for minimax optimization problems
- An interior-point trust-region algorithm to solve a finite nonlinear minimax problem
- A neural network-type cutting plane algorithm for nonsmooth constrained optimization
- A modified SQP algorithm for minimax problems
- Nonsmooth equations approach to a constrained minimax problem.
This page was built for publication: Nonmonotone line search algorithm for constrained minimax problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1812065)
