Smoothing Approximation to the New Exact Penalty Function with Two Parameters
From MaRDI portal
Publication:5024902
DOI10.1142/S0217595921400108zbMath1484.90116OpenAlexW3155753760MaRDI QIDQ5024902
No author found.
Publication date: 1 February 2022
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0217595921400108
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A second-order smooth penalty function algorithm for constrained optimization problems
- Smoothing of the lower-order exact penalty function for inequality constrained optimization
- Smoothing approximation to the lower order exact penalty function for inequality constrained optimization
- An objective penalty function method for nonlinear programming.
- A simple smooth exact penalty function for smooth optimization problem
- An augmented Lagrangian algorithm for solving semiinfinite programming
- Smoothing approximation to \(l_1\) exact penalty function for inequality constrained optimization
- A class of exact penalty functions and penalty algorithms for nonsmooth constrained optimization problems
- A penalty function algorithm with objective parameters for nonlinear mathematical programming
- A Smoothing Objective Penalty Function Algorithm for Inequality Constrained Optimization Problems
- Optimization by Least Squares
- Non-Linear Programming Via Penalty Functions
This page was built for publication: Smoothing Approximation to the New Exact Penalty Function with Two Parameters