A sequential quadratic programming algorithm for nonlinear minimax problems
From MaRDI portal
Publication:5301244
DOI10.1017/S0004972700039745zbMATH Open1146.90088MaRDI QIDQ5301244FDOQ5301244
Authors: Qingjie Hu, Juzhou Hu 
Publication date: 29 April 2008
Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)
Recommendations
- A modified SQP algorithm for minimax problems
- A new superlinearly convergent SQP algorithm for nonlinear minimax problems
- scientific article; zbMATH DE number 1932369
- Simple sequential quadratically constrained quadratic programming feasible algorithm with active identification sets for constrained minimax problems
- Feasible generalized monotone line search SQP algorithm for nonlinear minimax problems with inequality constraints
Numerical optimization and variational techniques (65K10) Methods of successive quadratic programming type (90C55) Minimax problems in mathematical programming (90C47)
Cites Work
- Smooth Optimization Methods for Minimax Problems
- A globally convergent method for nonlinear programming
- Exact penalty function algorithm with simple updating of the penalty parameter
- A surperlinearly convergent algorithm for constrained optimization problems
- Nonmonotone line search for minimax problems
- A compact variable metric algorithm for nonlinear minimax approximation
- New minimax algorithm
- Nonmonotone line search algorithm for constrained minimax problems
- Superlinearly convergent algorithm for min-max problems
- Variable metric methods for minimizing a class of nondifferentiable functions
- On combining feasibility, descent and superlinear convergence in inequality constrained optimization
- An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity
- A superlinearly and quadratically convergent SQP type feasible method for constrained optimization
- Computer-aided design via optimization: A review
Cited In (16)
- Simple sequential quadratically constrained quadratic programming feasible algorithm with active identification sets for constrained minimax problems
- An improved sequential quadratic programming algorithm for solving general nonlinear programming problems
- A modified SQP algorithm for minimax problems
- A noniterative algorithm for the linear-quadratic profit-maximization model for smoothing multiproduct production
- A sequential quadratic programming algorithm for nonconvex, nonsmooth constrained optimization
- A new superlinearly convergent SQP algorithm for nonlinear minimax problems
- Title not available (Why is that?)
- A sequential quadratic programming algorithm with non-monotone line search
- Title not available (Why is that?)
- Corrected sequential linear programming for sparse minimax optimization
- A Sequential Minimization Technique for Elliptic Quasi-variational Inequalities with Gradient Constraints
- An active set sequential quadratic programming algorithm for nonlinear optimisation
- Title not available (Why is that?)
- Generalised monotone line search algorithm for degenerate nonlinear minimax problems
- An improved SQP algorithm for solving minimax problems
- A class of algorithms for large scale nonlinear minimax optimization
This page was built for publication: A sequential quadratic programming algorithm for nonlinear minimax problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5301244)
