New exact penalty function for solving constrained finite min-max problems
From MaRDI portal
Publication:764635
DOI10.1007/s10483-012-1548-6zbMath1233.90258OpenAlexW112276359MaRDI QIDQ764635
Xun Li, Cheng Ma, Ka-Fai Cedric Yiu, Lian-Sheng 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
Related Items
Smooth exact penalty functions: a general approach, Smooth exact penalty functions. II: A reduction to standard exact penalty functions, A new objective penalty function approach for solving constrained minimax problems, An active-set algorithm and a trust-region approach in constrained minimax problem, A unified approach to the global exactness of penalty and augmented Lagrangian functions. II: Extended exactness
Cites Work
- Unnamed Item
- Unnamed Item
- A smooth method for the finite minimax problem
- A smoothing trust-region Newton-CG method for minimax problem
- An interior-point algorithm for nonlinear minimax problems
- An improved SQP algorithm for solving minimax problems
- Error bounds in mathematical programming
- Computational schemes for large-scale problems in extended linear- quadratic programming
- Superlinearly convergent algorithm for min-max problems
- Worst-Case Conditional Value-at-Risk with Application to Robust Portfolio Management
- A smoothing-out technique for min—max optimization
- A bundle type approach to the unconstrained minimization of convex nonsmooth functions
- An Exact Penalization Viewpoint of Constrained Optimization
- A New Exact Penalty Function
- Linear-Quadratic Programming and Optimal Control
- An SQP Algorithm for Finely Discretized Continuous Minimax Problems and Other Minimax Problems with Many Objective Functions
- A Regularization Method for Solving the Finite Convex Min-Max Problem
