On the smoothing of the square-root exact penalty function for inequality constrained optimization

DOI10.1007/s10589-006-8720-6zbMath1128.90055OpenAlexW2020240290MaRDI QIDQ861516

Chuangyin Dang, Zhiqing Meng, Xiao Qi Yang

Publication date: 29 January 2007

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-006-8720-6

zbMATH Keywords

constrained optimizationpenalty functionoptimal solutionsmoothing methodexact penalty function\(\varepsilon\)-feasible solution,

Mathematics Subject Classification ID

Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Related Items

Smoothing approximation to the lower order exact penalty function for inequality constrained optimization ⋮ A Smoothing Objective Penalty Function Algorithm for Inequality Constrained Optimization Problems ⋮ An M-objective penalty function algorithm under big penalty parameters ⋮ The smoothing objective penalty function method for two-cardinality sparse constrained optimization problems ⋮ Time-optimal of fixed wing UAV aircraft with input and output constraints ⋮ On the convergence of a smooth penalty algorithm without computing global solutions ⋮ A New Smoothing Approach for Piecewise Smooth Functions: Application to Some Fundamental Functions ⋮ An interior-point \(\ell_{\frac{1}{2}}\)-penalty method for inequality constrained nonlinear optimization ⋮ A new class of exact penalty functions and penalty algorithms ⋮ On Smoothingl₁Exact Penalty Function for Constrained Optimization Problems ⋮ Smoothing Partially Exact Penalty Function of Biconvex Programming ⋮ Second-Order Smoothing Objective Penalty Function for Constrained Optimization Problems ⋮ A penalty function method based on smoothing lower order penalty function ⋮ Smoothing approximation to \(l_1\) exact penalty function for inequality constrained optimization ⋮ Augmented Lagrangian Objective Penalty Function ⋮ A novel penalty function method for semivectorial bilevel programming problem ⋮ Smoothing of the lower-order exact penalty function for inequality constrained optimization ⋮ On smoothing exact penalty functions for nonlinear constrained optimization problems ⋮ Smoothing approximations for piecewise smooth functions: a probabilistic approach

Cites Work

• On the exactness of a class of nondifferentiable penalty functions
• A globally convergent algorithm for exact penalty functions
• Space-times of low differentiability and singularities
• Entropy optimization and mathematical programming
• Semismooth Newton methods for solving semi-infinite programming problems
• Smoothing methods for convex inequalities and linear complementarity problems
• Scheduling with monotonous earliness and tardiness penalties
• 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
• On Smoothing Exact Penalty Functions for Convex Constrained Optimization
• Smoothing Nonlinear Penalty Functions for Constrained Optimization Problems
• Globally Convergent Algorithms for Convex Programming
• Non-Linear Programming Via Penalty Functions
• Computational discretization algorithms for functional inequality constrained optimization