An M-objective penalty function algorithm under big penalty parameters
From MaRDI portal
Publication:328083
DOI10.1007/S11424-015-3204-3zbMATH Open1354.90144OpenAlexW2213047452MaRDI QIDQ328083FDOQ328083
Authors: Ying Zheng, Zhiqing Meng, R. 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
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.
Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56)
Cites Work
- Title not available (Why is that?)
- Optimization and nonsmooth analysis
- Entropy optimization and mathematical programming
- Exact penalty functions in nonlinear programming
- Title not available (Why is that?)
- An Exact Penalization Viewpoint of Constrained Optimization
- Optimization by Least Squares
- Non-Linear Programming Via Penalty Functions
- Semismooth Newton methods for solving semi-infinite programming problems
- Computational discretization algorithms for functional inequality constrained optimization
- A line search exact penalty method using steering rules
- On Smoothing Exact Penalty Functions for Convex Constrained Optimization
- An approximate method for local optima for nonlinear mixed integer programming problems
- Automatic decrease of the penalty parameter in exact penalty function methods
- 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
- Exact penalty functions and stability in locally Lipschitz programming
- An exact penalty function method with global convergence properties for nonlinear programming problems
- 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*
- Duality and exact penalization for vector optimization via augmented Lagrangian
- On the smoothing of the square-root exact penalty function for inequality constrained optimization
Cited In (4)
- Lower-order smoothed objective penalty functions based on filling properties for constrained optimization problems
- Two Classes of Smooth Objective Penalty Functions for Constrained Problems
- A filled penalty function method for solving constrained optimization problems
- An approach to solve local and global optimization problems based on exact objective filled penalty functions
Uses Software
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)
