A penalty function algorithm with objective parameters for nonlinear mathematical programming
From MaRDI portal
Publication:2379807
DOI10.3934/jimo.2009.5.585zbMath1187.65066OpenAlexW2016611441MaRDI QIDQ2379807
Zhiqing Meng, Qiying Hu, Chuangyin Dang
Publication date: 22 March 2010
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2009.5.585
algorithmglobal convergencenumerical examplesnonlinear programmingconstraintpenalty functionobjective parameter
Related Items
An exact \(l_1\) penalty approach for interval-valued programming problem ⋮ Solving vector interval-valued optimization problems with infinite interval constraints via integral-type penalty function ⋮ A Smoothing Objective Penalty Function Algorithm for Inequality Constrained Optimization Problems ⋮ An M-objective penalty function algorithm under big penalty parameters ⋮ Exactness and algorithm of an objective penalty function ⋮ An objective penalty method for optimistic bilevel programming problems ⋮ An objective penalty function of bilevel programming ⋮ A hybrid method combining genetic algorithm and Hooke-Jeeves method for constrained global optimization ⋮ On Smoothingl1Exact Penalty Function for Constrained Optimization Problems ⋮ 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 ⋮ Second-Order Smoothing Objective Penalty Function for Constrained Optimization Problems ⋮ An Objective Penalty Function Algorithm for Bilevel Programming Based on Multi-Parameters ⋮ DISTRIBUTED PROXIMAL-GRADIENT METHOD FOR CONVEX OPTIMIZATION WITH INEQUALITY CONSTRAINTS ⋮ Augmented Lagrangian Objective Penalty Function ⋮ A QP-free algorithm of quasi-strongly sub-feasible directions for inequality constrained optimization ⋮ An objective penalty function method for biconvex programming ⋮ Smoothing Approximation to the New Exact Penalty Function with Two Parameters
