Exactness and algorithm of an objective penalty function
From MaRDI portal
Publication:2392750
Recommendations
- An objective penalty function method for nonlinear programming.
- An exact penalty function of objective parameter
- A penalty function algorithm with objective parameters for nonlinear mathematical programming
- Augmented Lagrangian Objective Penalty Function
- An objective penalty function-based method for inequality constrained minimization problem
Cites work
- scientific article; zbMATH DE number 3744430 (Why is no real title available?)
- scientific article; zbMATH DE number 3307153 (Why is no real title available?)
- A Boolean penalty method for zero-one nonlinear programming
- A nonlinear Lagrangian approach to constrained optimization problems
- A penalty function algorithm with objective parameters for nonlinear mathematical programming
- A smoothing objective penalty function algorithm for inequality constrained optimization problems
- A sufficient condition for exact penalty functions
- An Exact Penalization Viewpoint of Constrained Optimization
- An exact penalty function method with global convergence properties for nonlinear programming problems
- An objective penalty function method for nonlinear programming.
- Automatic decrease of the penalty parameter in exact penalty function methods
- Calmness and Exact Penalization
- Calmness and exact penalization in vector optimization with cone constraints
- Calmness in optimization problems with equality constraints
- Decreasing Functions with Applications to Penalization
- Duality and exact penalization for vector optimization via augmented Lagrangian
- Exact Penalty Functions in Constrained Optimization
- Exact penalty functions and calmness for mathematical programming under nonlinear perturbations
- Exact penalty functions and stability in locally Lipschitz programming
- Exact penalty functions in nonlinear programming
- Exact penalty property for a class of inequality-constrained minimization problems
- Extended Lagrange And Penalty Functions in Continuous Optimization*
- Globally Convergent Algorithms for Convex Programming
- Handbook of applied optimization
- Mathematical theory of optimization
- Non-Linear Programming Via Penalty Functions
- On Smoothing Exact Penalty Functions for Convex Constrained Optimization
- Optimization and nonsmooth analysis
- Optimization by Least Squares
Cited in
(19)- A new objective penalty function approach for solving constrained minimax problems
- Algorithm of Barrier Objective Penalty Function
- An objective penalty function method for nonlinear programming.
- Two Classes of Smooth Objective Penalty Functions for Constrained Problems
- Sufficiency of Exact Penalty Minimization
- A filled penalty function method for solving constrained optimization problems
- An exact penalty function based on the projection matrix
- An exact penalty function of objective parameter
- A penalty function algorithm with objective parameters for nonlinear mathematical programming
- An objective penalty method for optimistic bilevel programming problems
- New exact penalty functions for nonlinear constrained optimization problems
- An objective penalty function method for biconvex programming
- Augmented Lagrangian Objective Penalty Function
- A unifying theory of exactness of linear penalty functions II: parametric penalty functions
- Lower-order smoothed objective penalty functions based on filling properties for constrained optimization problems
- An objective penalty function-based method for inequality constrained minimization problem
- Use of exact penalty functions to determine efficient decisions
- scientific article; zbMATH DE number 6747041 (Why is no real title available?)
- An approach to solve local and global optimization problems based on exact objective filled penalty functions
This page was built for publication: Exactness and algorithm of an objective penalty function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2392750)
