A filled penalty function method for solving constrained optimization problems

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Convergence results of an augmented Lagrangian method using the exponential penalty function
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
Saddle points of general augmented Lagrangians for constrained nonconvex optimization
Smoothing of the lower-order exact penalty function for inequality constrained optimization
Unification of filled function and tunnelling function in global optimization
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
A barrier objective penalty function algorithm for mathematical programming
Two Classes of Smooth Objective Penalty Functions for Constrained Problems
Lower-order smoothed objective penalty functions based on filling properties for constrained optimization problems
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: 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)