An M-objective penalty function algorithm under big penalty parameters
From MaRDI portal
Publication:328083
DOI10.1007/s11424-015-3204-3zbMath1354.90144OpenAlexW2213047452MaRDI QIDQ328083
Zhiqing Meng, Ying Zheng, Rui Shen
Publication date: 20 October 2016
Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11424-015-3204-3
Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56)
Related Items (3)
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 ⋮ Two Classes of Smooth Objective Penalty Functions for Constrained Problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A line search exact penalty method using steering rules
- On the smoothing of the square-root exact penalty function for inequality constrained optimization
- An approximate method for local optima for nonlinear mixed integer programming problems
- Entropy optimization and mathematical programming
- Automatic decrease of the penalty parameter in exact penalty function methods
- Semismooth Newton methods for solving semi-infinite programming problems
- A Boolean penalty method for zero-one nonlinear programming
- Scheduling with monotonous earliness and tardiness penalties
- A penalty function algorithm with objective parameters for nonlinear mathematical programming
- A Nonlinear Lagrangian Approach to Constrained Optimization Problems
- Optimization and nonsmooth analysis
- Exact penalty functions and stability in locally Lipschitz programming
- An exact penalty function method with global convergence properties for nonlinear programming problems
- Exact penalty functions in nonlinear programming
- An Exact Penalization Viewpoint of Constrained Optimization
- On Smoothing Exact Penalty Functions for Convex Constrained Optimization
- Smoothing Nonlinear Penalty Functions for Constrained Optimization Problems
- Globally Convergent Algorithms for Convex Programming
- Decreasing Functions with Applications to Penalization
- Extended Lagrange And Penalty Functions in Continuous Optimization*
- Optimization by Least Squares
- Non-Linear Programming Via Penalty Functions
- Computational discretization algorithms for functional inequality constrained optimization
- Duality and exact penalization for vector optimization via augmented Lagrangian
This page was built for publication: An M-objective penalty function algorithm under big penalty parameters
