Smoothing of the lower-order exact penalty function for inequality constrained optimization

DOI10.1186/s13660-016-1126-9zbMath1354.90097OpenAlexW2504889948WikidataQ59466725 ScholiaQ59466725MaRDI QIDQ737061

Shujun Lian, Yaqiong Duan

Publication date: 5 August 2016

Published in: Journal of Inequalities and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1186/s13660-016-1126-9

zbMATH Keywords

inequality constrained optimizationsmoothing methodexact penalty functionlower-order penalty function

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Related Items (16)

A linearly convergent algorithm for sparse signal reconstruction ⋮ Smoothing approximation to the lower order exact penalty function for inequality constrained optimization ⋮ A primal–dual penalty method via rounded weighted-ℓ₁ Lagrangian duality ⋮ Lower-order smoothed objective penalty functions based on filling properties for constrained optimization problems ⋮ Primal-dual interior point QP-free algorithm for nonlinear constrained optimization ⋮ A New Smoothing Approach for Piecewise Smooth Functions: Application to Some Fundamental Functions ⋮ An approach to solve local and global optimization problems based on exact objective filled penalty functions ⋮ An objective penalty function-based method for inequality constrained minimization problem ⋮ Two Classes of Smooth Objective Penalty Functions for Constrained Problems ⋮ On Smoothingl₁Exact Penalty Function for Constrained Optimization Problems ⋮ HIGH-ORDER COPOSITIVE TENSORS AND ITS APPLICATIONS ⋮ Fuzzy relation lexicographic programming for modelling P2P file sharing system ⋮ Evaluation model and approximate solution to inconsistent max-min fuzzy relation inequalities in P2P file sharing system ⋮ Smoothing approximations for piecewise smooth functions: a probabilistic approach ⋮ An accelerated augmented Lagrangian method for multi-criteria optimization problem ⋮ Smoothing Approximation to the New Exact Penalty Function with Two Parameters

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A second-order smooth penalty function algorithm for constrained optimization problems
• A modified exact smooth penalty function for nonlinear constrained optimization
• On the smoothing of the square-root exact penalty function for inequality constrained optimization
• On smoothing exact penalty functions for nonlinear constrained optimization problems
• A collection of test problems for constrained global optimization algorithms
• Convergence analysis of a class of nonlinear penalization methods for constrained optimization via first-order necessary optimality conditions
• Smoothing approximation to the square-order exact penalty functions for constrained optimization
• Value-estimation function method for constrained global optimization
• Smoothing approximation to \(l_1\) exact penalty function for inequality constrained optimization
• SMOOTHING APPROXIMATION TO l₁EXACT PENALTY FUNCTION FOR CONSTRAINED OPTIMIZATION PROBLEMS
• A smoothing-out technique for min—max optimization
• On Smoothing Exact Penalty Functions for Convex Constrained Optimization
• Penalty functions with a small penalty parameter
• An exact lower order penalty function and its smoothing in nonlinear programming
• Second-Order Smoothing Objective Penalty Function for Constrained Optimization Problems
• Non-Linear Programming Via Penalty Functions
• Mathematical Programs with Equilibrium Constraints

This page was built for publication: Smoothing of the lower-order exact penalty function for inequality constrained optimization