Exactness and algorithm of an objective penalty function
From MaRDI portal
Publication:2392750
DOI10.1007/s10898-012-9900-9zbMath1296.90093OpenAlexW1980550910MaRDI QIDQ2392750
Min Jiang, Rui Shen, Zhiqing Meng, Chuangyin Dang, Xin-Sheng Xu
Publication date: 2 August 2013
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-012-9900-9
stabilitymathematical programmingcalmnessinequality constrained optimizationexactnessobjective penalty function
Related Items
An exact penalty function based on the projection matrix, Lower-order smoothed objective penalty functions based on filling properties for constrained optimization problems, An objective penalty method for optimistic bilevel programming problems, An approach to solve local and global optimization problems based on exact objective filled penalty functions, An objective penalty function-based method for inequality constrained minimization problem, New exact penalty functions for nonlinear constrained optimization problems, Two Classes of Smooth Objective Penalty Functions for Constrained Problems, A new objective penalty function approach for solving constrained minimax problems, Augmented Lagrangian Objective Penalty Function, An objective penalty function method for biconvex programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A sufficient condition for exact penalty functions
- Calmness and exact penalization in vector optimization with cone constraints
- Exact penalty property for a class of inequality-constrained minimization problems
- Exact penalty functions and calmness for mathematical programming under nonlinear perturbations
- Automatic decrease of the penalty parameter in exact penalty function methods
- A Boolean penalty method for zero-one nonlinear programming
- An objective penalty function method for nonlinear programming.
- Calmness in optimization problems with equality constraints
- A penalty function algorithm with objective parameters for nonlinear mathematical programming
- A Nonlinear Lagrangian Approach to Constrained Optimization Problems
- A Smoothing Objective Penalty Function Algorithm for Inequality Constrained Optimization Problems
- Calmness and Exact Penalization
- Optimization and nonsmooth analysis
- Exact penalty functions and stability in locally Lipschitz programming
- An exact penalty function method with global convergence properties for nonlinear programming problems
- Exact penalty functions in nonlinear programming
- An Exact Penalization Viewpoint of Constrained Optimization
- On Smoothing Exact Penalty Functions for Convex Constrained Optimization
- Exact Penalty Functions in Constrained Optimization
- Globally Convergent Algorithms for Convex Programming
- Decreasing Functions with Applications to Penalization
- Extended Lagrange And Penalty Functions in Continuous Optimization*
- Optimization by Least Squares
- Non-Linear Programming Via Penalty Functions
- Mathematical theory of optimization
- Duality and exact penalization for vector optimization via augmented Lagrangian
