A generalized gradient projection method based on a new working set for minimax optimization problems with inequality constraints
From MaRDI portal
(Redirected from Publication:515950)
Recommendations
- A generalized gradient projection method for optimization problems with equality and inequality constraints about arbitrary initial point
- A new generalized gradient projection method for general constrained optimization
- A strongly convergent generalized gradient projection method for minimax optimization with general constraints
- An \(\varepsilon\)-generalized gradient projection method for nonlinear minimax problems
- A general regularized gradient-projection method for solving equilibrium and constrained convex minimization problems
- scientific article; zbMATH DE number 857678
- scientific article; zbMATH DE number 4030852
- A generalized gradient projection algorithm of optimization with nonlinear constraints
- Generalized gradient projection algorithm for unconstrained minimax problems
- A generalized gradient projection algorithm for a mathematical program with complementarity constraints
Cites work
- A bundle type approach to the unconstrained minimization of convex nonsmooth functions
- A feasible descent bundle method for inequality constrained minimax problems
- A sequential quadratically constrained quadratic programming method for unconstrained minimax problems
- A smoothing trust-region Newton-CG method for minimax problem
- A truncated aggregate smoothing Newton method for minimax problems
- Active Set Identification in Nonlinear Programming
- Algorithms with adaptive smoothing for finite minimax problems
- An Incremental Method for Solving Convex Finite Min-Max Problems
- An SQP Algorithm for Finely Discretized Continuous Minimax Problems and Other Minimax Problems with Many Objective Functions
- An \(\varepsilon\)-generalized gradient projection method for nonlinear minimax problems
- An adaptive nonmonotone trust-region method with curvilinear search for minimax problem
- An algorithm based on active sets and smoothing for discretized semi-infinite minimax problems
- An extended multifacility minimax location problem revisited
- An improved SQP algorithm for solving minimax problems
- An interior-point algorithm for nonlinear minimax problems
- Generalized monotone line search SQP algorithm for constrained minimax problems
- On Rosen's gradient projection methods
- On the Accurate Identification of Active Constraints
- On the Identification of Active Constraints
- On the accurate identification of active set for constrained minimax problems
- Portfolio optimization under a minimax rule
- Second-order duality for nondifferentiable minimax fractional programming problems with generalized convexity
- Simple sequential quadratically constrained quadratic programming feasible algorithm with active identification sets for constrained minimax problems
- Smoothing method for minimax problems
- Superlinearly convergent algorithm for min-max problems
- Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems
- The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
Cited in
(6)- scientific article; zbMATH DE number 6263482 (Why is no real title available?)
- Generalized gradient projection algorithm for unconstrained minimax problems
- A generalized gradient projection method for optimization problems with equality and inequality constraints about arbitrary initial point
- Generalized project algorithm for solving unconstrained minimax problems
- A strongly convergent generalized gradient projection method for minimax optimization with general constraints
- An \(\varepsilon\)-generalized gradient projection method for nonlinear minimax problems
This page was built for publication: A generalized gradient projection method based on a new working set for minimax optimization problems with inequality constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q515950)
