Two Classes of Smooth Objective Penalty Functions for Constrained Problems

DOI10.1080/01630563.2018.1554586zbMath1411.90328OpenAlexW2910334512WikidataQ128594563 ScholiaQ128594563MaRDI QIDQ4634139

Jiahui Tang, Wei Wang, Yi-Fan Xu

Publication date: 7 May 2019

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01630563.2018.1554586

zbMATH Keywords

constrained optimizationapproximate solutionsmooth objective penalty functionwell-condition

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items

Lower-order smoothed objective penalty functions based on filling properties for constrained optimization problems ⋮ An approach to solve local and global optimization problems based on exact objective filled penalty functions

Cites Work

• An M-objective penalty function algorithm under big penalty parameters
• A new objective penalty function approach for solving constrained minimax problems
• Smoothing of the lower-order exact penalty function for inequality constrained optimization
• A nonlinear programming algorithm based on non-coercive penalty functions
• An objective penalty function method for nonlinear programming.
• A simple smooth exact penalty function for smooth optimization problem
• Smoothing approximation to \(l_1\) exact penalty function for inequality constrained optimization
• Exactness and algorithm of an objective penalty function
• Augmented Lagrangian Objective Penalty Function
• A Barrier Method for Large-Scale Constrained Optimization
• Non-Linear Programming Via Penalty Functions
• Unnamed Item
• Unnamed Item
• Unnamed Item