A penalty function algorithm with objective parameters for nonlinear mathematical programming
From MaRDI portal
Publication:2379807
The authors establish some theorems for the penalty function and present an objective parameters function algorithm to solve the inequality constrained optimization problem. The global convergence is proved without any convex conditions. Some numerical experimental results are presented to show the effectiveness of the proposed algorithm.
Recommendations
- An objective penalty function method for nonlinear programming.
- An exact penalty function of objective parameter
- scientific article; zbMATH DE number 6747041
- Exactness and algorithm of an objective penalty function
- A smoothing objective penalty function algorithm for inequality constrained optimization problems
Cited in
(32)- Interval goal programming for S-shaped penalty function
- An objective penalty function-based method for inequality constrained minimization problem
- An objective penalty function method for nonlinear programming.
- An objective penalty function method for biconvex programming
- An objective penalty method for optimistic bilevel programming problems
- An exact \(l_1\) penalty approach for interval-valued programming problem
- Exactness and algorithm of an objective penalty function
- A hybrid method combining genetic algorithm and Hooke-Jeeves method for constrained global optimization
- A QP-free algorithm of quasi-strongly sub-feasible directions for inequality constrained optimization
- Augmented Lagrangian Objective Penalty Function
- A barrier objective penalty function algorithm for mathematical programming
- An exact penalty function of objective parameter
- A smoothing objective penalty function algorithm for inequality constrained optimization problems
- Algorithm of exponential-type exact penalty function for nonlinear inequality constrained optimization
- An M-objective penalty function algorithm under big penalty parameters
- scientific article; zbMATH DE number 4167868 (Why is no real title available?)
- A new algorithm for solving constrained optimization on exact penalty with two parameters
- scientific article; zbMATH DE number 1186904 (Why is no real title available?)
- An objective penalty function of bilevel programming
- On smoothing $l_1$ exact penalty function for constrained optimization problems
- scientific article; zbMATH DE number 4119959 (Why is no real title available?)
- A quadratic objective penalty function for bilevel programming
- An exact \(l_1\) exponential penalty function method for multiobjective optimization problems with exponential-type invexity
- A new objective penalty function approach for solving constrained minimax problems
- An objective penalty function algorithm for bilevel programming based on multi-parameters
- Smoothing approximation to the new exact penalty function with two parameters
- Solving vector interval-valued optimization problems with infinite interval constraints via integral-type penalty function
- Distributed proximal-gradient method for convex optimization with inequality constraints
- Triangle-type exact penalty function algorithm for inequality nonlinear constrained optimization problems
- scientific article; zbMATH DE number 6747041 (Why is no real title available?)
- Second-Order Smoothing Objective Penalty Function for Constrained Optimization Problems
- A class of objective filled penalty functions for minimax global optimization problem
This page was built for publication: A penalty function algorithm with objective parameters for nonlinear mathematical programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2379807)
