An M-objective penalty function algorithm under big penalty parameters
From MaRDI portal
Recommendations
- Penalty functions for the multiobjective optimization problem
- A penalty function algorithm with objective parameters for nonlinear mathematical programming
- An objective penalty function method for biconvex programming
- An objective penalty function algorithm for bilevel programming based on multi-parameters
- scientific article; zbMATH DE number 6747041
- Exponential penalty function with MOMA-plus for the multiobjective optimization problems
- The exponential penalty function method for multiobjective programming problems
- A new objective penalty function approach for solving constrained minimax problems
- A multiobjective interval goal programming method using penalty function
- An objective penalty function method for nonlinear programming.
Cites work
- scientific article; zbMATH DE number 3744430 (Why is no real title available?)
- scientific article; zbMATH DE number 3307153 (Why is no real title available?)
- A Boolean penalty method for zero-one nonlinear programming
- A line search exact penalty method using steering rules
- A nonlinear Lagrangian approach to constrained optimization problems
- A penalty function algorithm with objective parameters for nonlinear mathematical programming
- An Exact Penalization Viewpoint of Constrained Optimization
- An approximate method for local optima for nonlinear mixed integer programming problems
- An exact penalty function method with global convergence properties for nonlinear programming problems
- Automatic decrease of the penalty parameter in exact penalty function methods
- Computational discretization algorithms for functional inequality constrained optimization
- Decreasing Functions with Applications to Penalization
- Duality and exact penalization for vector optimization via augmented Lagrangian
- Entropy optimization and mathematical programming
- Exact penalty functions and stability in locally Lipschitz programming
- Exact penalty functions in nonlinear programming
- Extended Lagrange And Penalty Functions in Continuous Optimization*
- Globally Convergent Algorithms for Convex Programming
- Non-Linear Programming Via Penalty Functions
- On Smoothing Exact Penalty Functions for Convex Constrained Optimization
- On the smoothing of the square-root exact penalty function for inequality constrained optimization
- Optimization and nonsmooth analysis
- Optimization by Least Squares
- Scheduling with monotonous earliness and tardiness penalties
- Semismooth Newton methods for solving semi-infinite programming problems
- Smoothing Nonlinear Penalty Functions for Constrained Optimization Problems
Cited in
(4)- Two Classes of Smooth Objective Penalty Functions for Constrained Problems
- A filled penalty function method for solving constrained optimization problems
- Lower-order smoothed objective penalty functions based on filling properties for constrained optimization problems
- An approach to solve local and global optimization problems based on exact objective filled penalty functions
This page was built for publication: An M-objective penalty function algorithm under big penalty parameters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q328083)
