Pages that link to "Item:Q2392750"
From MaRDI portal
The following pages link to Exactness and algorithm of an objective penalty function (Q2392750):
Displaying 19 items.
- An exact penalty function based on the projection matrix (Q278572) (← links)
- A new objective penalty function approach for solving constrained minimax problems (Q489101) (← links)
- An objective penalty function-based method for inequality constrained minimization problem (Q1721383) (← links)
- New exact penalty functions for nonlinear constrained optimization problems (Q1724863) (← links)
- An objective penalty function method for nonlinear programming. (Q1764582) (← links)
- An objective penalty function method for biconvex programming (Q2052381) (← links)
- An objective penalty method for optimistic bilevel programming problems (Q2176835) (← links)
- A penalty function algorithm with objective parameters for nonlinear mathematical programming (Q2379807) (← links)
- Use of exact penalty functions to determine efficient decisions (Q2638947) (← links)
- An approach to solve local and global optimization problems based on exact objective filled penalty functions (Q2691319) (← links)
- Augmented Lagrangian Objective Penalty Function (Q2795100) (← links)
- An exact penalty function of objective parameter (Q2926787) (← links)
- A unifying theory of exactness of linear penalty functions II: parametric penalty functions (Q4598822) (← links)
- Algorithm of Barrier Objective Penalty Function (Q4602162) (← links)
- Two Classes of Smooth Objective Penalty Functions for Constrained Problems (Q4634139) (← links)
- Lower-order smoothed objective penalty functions based on filling properties for constrained optimization problems (Q5085235) (← links)
- Sufficiency of Exact Penalty Minimization (Q5184681) (← links)
- (Q5277482) (← links)
- A filled penalty function method for solving constrained optimization problems (Q6612419) (← links)
