Smoothing Nonlinear Penalty Functions for Constrained Optimization Problems

Recommendations

On smoothing exact penalty functions for nonlinear constrained optimization problems
A smoothing exact penalty function algorithm for nonlinear constrained optimization problems
On Smoothing Exact Penalty Functions for Convex Constrained Optimization
scientific article; zbMATH DE number 6263697
Publication:3476212
Implementing a smooth exact penalty function for general constrained nonlinear optimization
Smoothing approximation to the square-order exact penalty functions for constrained optimization
A modified exact smooth penalty function for nonlinear constrained optimization
Smoothing approximation to the k-th power nonlinear penalty function for constrained optimization problems
Smoothed penalty algorithms for optimization of nonlinear models

Cites work

scientific article; zbMATH DE number 3914081 (Why is no real title available?)
scientific article; zbMATH DE number 1243473 (Why is no real title available?)
A nonlinear Lagrangian approach to constrained optimization problems
An exterior point method for computing points that satisfy second-order necessary conditions for a \(C^{1,1}\) optimization problem
Asymptotic Analysis for Penalty and Barrier Methods in Convex and Linear Programming
Decreasing Functions with Applications to Penalization
Exact penalty functions and stability in locally Lipschitz programming
Extended Lagrange And Penalty Functions in Continuous Optimization^*
On Smoothing Exact Penalty Functions for Convex Constrained Optimization
On the exactness of a class of nondifferentiable penalty functions
Smoothing approximations to nonsmooth optimization problems
Trust Region Methods

Cited in

(28)

Smoothing approximation to the square-order exact penalty functions for constrained optimization
An interior-point \(\ell_{\frac{1}{2}}\)-penalty method for inequality constrained nonlinear optimization
Two Classes of Smooth Objective Penalty Functions for Constrained Problems
Modification of a method of the gradient type for minimization of visual penalty functions
Penalty-free method for nonsmooth constrained optimization via radial basis functions
Implementing a smooth exact penalty function for general constrained nonlinear optimization
The smoothing objective penalty function method for two-cardinality sparse constrained optimization problems
On Smoothingl₁Exact Penalty Function for Constrained Optimization Problems
A penalized nonparametric method for nonlinear constrained optimization based on noisy data
A robust SQP method based on a smoothing lower order penalty function†
Smoothed penalty algorithms for optimization of nonlinear models
scientific article; zbMATH DE number 4119957 (Why is no real title available?)
A penalty function method based on smoothing lower order penalty function
A class of objective filled penalty functions for minimax global optimization problem
An M-objective penalty function algorithm under big penalty parameters
On smoothing exact penalty functions for nonlinear constrained optimization problems
On the smoothing of the square-root exact penalty function for inequality constrained optimization
scientific article; zbMATH DE number 6263697 (Why is no real title available?)
On the convergence analysis of a penalty algorithm for nonsmooth optimization and its performance for solving hard-sphere problems
A second-order smooth penalty function algorithm for constrained optimization problems
Smoothing approximation to the k-th power nonlinear penalty function for constrained optimization problems
Second-Order Smoothing Objective Penalty Function for Constrained Optimization Problems
Smoothing augmented Lagrangian method for nonsmooth constrained optimization problems
A smoothing objective penalty function algorithm for inequality constrained optimization problems
A novel class of exact penalty function approach for optimization problems with inequality constraints
FINITE DIFFERENCE SMOOTHING SOLUTIONS OF NONSMOOTH CONSTRAINED OPTIMAL CONTROL PROBLEMS
Smoothing partially exact penalty function of biconvex programming
Solving NLP problems with dynamic system approach based on smoothed penalty function

This page was built for publication: Smoothing Nonlinear Penalty Functions for Constrained Optimization Problems

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