An exact minimax penalty function method and saddle point criteria for nonsmooth convex vector optimization problems
From MaRDI portal
Publication:289076
DOI10.1007/s10957-015-0812-yzbMath1356.90135OpenAlexW1800296562MaRDI QIDQ289076
Sarita Choudhury, Anurag Jayswal
Publication date: 27 May 2016
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-015-0812-y
Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Nonsmooth analysis (49J52)
Related Items (2)
The minimax exact penalty fuzzy function method for solving convex nonsmooth optimization problems with fuzzy objective functions ⋮ Saddle point criteria for multi-dimensional control optimisation problem involving first-order PDE constraints
Cites Work
- Unnamed Item
- Unnamed Item
- Saddle point criteria and the exact minimax penalty function method in nonconvex programming
- An exact \(l_1\) exponential penalty function method for multiobjective optimization problems with exponential-type invexity
- Optimization over the efficient set: overview
- An approach to constrained global optimization based on exact penalty functions
- Existence of value and saddle point in infinite-dimensional differential games.
- Exact penalty functions for nonlinear integer programming problems
- A lower bound for the penalty parameter in the exact minimax penalty function method for solving nondifferentiable extremum problems
- Local saddle point and a class of convexification methods for nonconvex optimization problems
- The exponential penalty function method for multiobjective programming problems
- Classification of Some Penalty Methods
- Nonsmooth multiobjective programming
- Algorithms for the vector maximization problem
- Convex Analysis
- Optimization over the efficient set
This page was built for publication: An exact minimax penalty function method and saddle point criteria for nonsmooth convex vector optimization problems
