Lower-order smoothed objective penalty functions based on filling properties for constrained optimization problems
From MaRDI portal
Publication:5085235
DOI10.1080/02331934.2020.1818746zbMath1489.90190OpenAlexW3087335435MaRDI QIDQ5085235
Wei Wang, Jiahui Tang, Yi-Fan Xu
Publication date: 27 June 2022
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2020.1818746
constrained optimizationglobally optimal solutionslocally optimal solutionsfilling propertiessmoothed objective penalty functions
Related Items (2)
Finding global minima with an inflection point-based filled function algorithm ⋮ An approach to solve local and global optimization problems based on exact objective filled penalty functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An M-objective penalty function algorithm under big penalty parameters
- A new objective penalty function approach for solving constrained minimax problems
- An approach to constrained global optimization based on exact penalty functions
- Smoothing of the lower-order exact penalty function for inequality constrained optimization
- Unification of filled function and tunnelling function in global optimization
- Convergence analysis of a class of nonlinear penalization methods for constrained optimization via first-order necessary optimality conditions
- An objective penalty function method for nonlinear programming.
- New classes of globally convexized filled functions for global optimization
- A simple smooth exact penalty function for smooth optimization problem
- Smoothing approximation to \(l_1\) exact penalty function for inequality constrained optimization
- A derivative-free algorithm for constrained global optimization based on exact penalty functions
- Exactness and algorithm of an objective penalty function
- Augmented Lagrangian Objective Penalty Function
- On Smoothing Exact Penalty Functions for Convex Constrained Optimization
- Penalty functions with a small penalty parameter
- Two Classes of Smooth Objective Penalty Functions for Constrained Problems
- An exact lower order penalty function and its smoothing in nonlinear programming
- A filled functiong method based on filter for global optimization with box constraints
- Non-Linear Programming Via Penalty Functions
This page was built for publication: Lower-order smoothed objective penalty functions based on filling properties for constrained optimization problems