A filled penalty function method for solving constrained optimization problems

DOI10.11948/20220125MaRDI QIDQ6612419zbMATH OpenFDO

Authors Jiahui Tang, Yifan Xu, Wei Wang

Publication date 30 September 2024

Published in Journal of Applied Analysis and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.11948/20220125

zbMATH Keywords

convergencefilled penalty function methodglobally optimal pointnon-convex constrained optimization problems

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Recommendations

• A filled function method for constrained global optimization
• An approach to solve local and global optimization problems based on exact objective filled penalty functions
• A class of filled functions for constrained global optimization
• A filled function method for inequality constrained global optimization
• A filled function method applied to nonsmooth constrained global optimization

Cites work

• A barrier objective penalty function algorithm for mathematical programming
• A derivative-free algorithm for constrained global optimization based on exact penalty functions
• A family of penalty functions approximate to \(l_1\) exact penalty function
• A filled function method based on filter for global optimization with box constraints
• A new class of exact penalty functions for equality constrained smooth optimization
• A new objective penalty function approach for solving constrained minimax problems
• A simple smooth exact penalty function for smooth optimization problem
• An approach to constrained global optimization based on exact penalty functions
• An M-objective penalty function algorithm under big penalty parameters
• An objective penalty function method for nonlinear programming.
• Augmented Lagrangian Objective Penalty Function
• Convergence results of an augmented Lagrangian method using the exponential penalty function
• Exactness and algorithm of an objective penalty function
• scientific article; zbMATH DE number 6796430 (Why is no real title available?)
• Lower-order smoothed objective penalty functions based on filling properties for constrained optimization problems
• New classes of globally convexized filled functions for global optimization
• Non-Linear Programming Via Penalty Functions
• Saddle points of general augmented Lagrangians for constrained nonconvex optimization
• Smoothing approximation to l₁ exact penalty function for inequality constrained optimization
• Smoothing of the lower-order exact penalty function for inequality constrained optimization
• Two Classes of Smooth Objective Penalty Functions for Constrained Problems
• Unification of filled function and tunnelling function in global optimization

Cited in

(3)

• An approach to solve local and global optimization problems based on exact objective filled penalty functions
• Flavoring search algorithm with applications to engineering optimization problems and robot path planning
• A class of objective filled penalty functions for minimax global optimization problem

This page was built for publication: A filled penalty function method for solving constrained optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6612419)