New exact penalty function for solving constrained finite min-max problems
From MaRDI portal
Publication:764635
DOI10.1007/S10483-012-1548-6zbMATH Open1233.90258OpenAlexW112276359MaRDI QIDQ764635FDOQ764635
Authors: Cheng Ma, Xun Li, Ka Fai Cedric Yiu, Liansheng Zhang 
Publication date: 13 March 2012
Published in: Applied Mathematics and Mechanics. (English Edition) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10483-012-1548-6
Recommendations
- A new objective penalty function approach for solving constrained minimax problems
- New exact penalty functions for nonlinear constrained optimization problems
- New simple exact penalty function for constrained minimization
- A new simple exact and smooth penalty function
- On an exact penalty function method for semi-infinite programming problems
Cites Work
- Error bounds in mathematical programming
- Title not available (Why is that?)
- Worst-case conditional value-at-risk with application to robust portfolio management
- An Exact Penalization Viewpoint of Constrained Optimization
- A New Exact Penalty Function
- A smoothing-out technique for min—max optimization
- An improved SQP algorithm for solving minimax problems
- Superlinearly convergent algorithm for min-max problems
- A smooth method for the finite minimax problem
- An SQP Algorithm for Finely Discretized Continuous Minimax Problems and Other Minimax Problems with Many Objective Functions
- A smoothing trust-region Newton-CG method for minimax problem
- An interior-point algorithm for nonlinear minimax problems
- A Regularization Method for Solving the Finite Convex Min-Max Problem
- Linear-Quadratic Programming and Optimal Control
- Title not available (Why is that?)
- A bundle type approach to the unconstrained minimization of convex nonsmooth functions
- Computational schemes for large-scale problems in extended linear- quadratic programming
Cited In (6)
- Title not available (Why is that?)
- Smooth exact penalty functions: a general approach
- A unified approach to the global exactness of penalty and augmented Lagrangian functions. II: Extended exactness
- A new objective penalty function approach for solving constrained minimax problems
- Smooth exact penalty functions. II: A reduction to standard exact penalty functions
- An active-set algorithm and a trust-region approach in constrained minimax problem
This page was built for publication: New exact penalty function for solving constrained finite min-max problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q764635)
