An exact minimax penalty function method and saddle point criteria for nonsmooth convex vector optimization problems

DOI10.1007/S10957-015-0812-YMaRDI QIDQ289076zbMATH OpenOpenAlexFDO

Authors Anurag Jayswal, Sarita Choudhury

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

zbMATH Keywords

penalty functionsaddle pointvector optimizationLagrange function

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Nonsmooth analysis (49J52)

Recommendations

• Saddle point criteria and the exact minimax penalty function method in nonconvex programming
• An Exact Penalty Function Algorithm for Non-smooth Convex Constrained Minimization Problems
• \(\varepsilon\)-optimality criteria for vector minimization problems via exact penalty functions
• An approximate exact penalty for vector inequality-constrained minimization problems
• A class of exact penalty functions and penalty algorithms for nonsmooth constrained optimization problems
• scientific article; zbMATH DE number 4010220
• Exact penalty functions in problems of nonsmooth optimization
• Exact penalties and sufficient conditions for optimality in nonsmooth optimization
• A lower bound for the penalty parameter in the exact minimax penalty function method for solving nondifferentiable extremum problems
• An algorithm for a constrained saddle point problem via an exact penalty method

Cites work

• A lower bound for the penalty parameter in the exact minimax penalty function method for solving nondifferentiable extremum problems
• Algorithms for the vector maximization problem
• An approach to constrained global optimization based on exact penalty functions
• An exact \(l_1\) exponential penalty function method for multiobjective optimization problems with exponential-type invexity
• Classification of some penalty methods
• Convex Analysis
• Exact penalty functions for nonlinear integer programming problems
• Existence of value and saddle point in infinite-dimensional differential games.
• Local saddle point and a class of convexification methods for nonconvex optimization problems
• Nonsmooth multiobjective programming
• Optimization over the efficient set
• Optimization over the efficient set: overview
• Practical methods of optimization.
• Saddle point criteria and the exact minimax penalty function method in nonconvex programming
• The \(l_1\) exact exponential penalty function method with \((p,r)-\rho-(\eta,\theta)\)-invexity
• The exponential penalty function method for multiobjective programming problems

Cited in

(7)

• Vector exponential penalty function method for nondifferentiable multiobjective programming problems
• Saddle point criteria for multi-dimensional control optimisation problem involving first-order PDE constraints
• Saddle point criteria and Wolfe duality for convex nonsmooth interval-valued vector optimization problems
• Saddle point criteria and the exact minimax penalty function method in nonconvex programming
• The vector exact \(l_{1}\) penalty method for nondifferentiable convex multiobjective programming problems
• The minimax exact penalty fuzzy function method for solving convex nonsmooth optimization problems with fuzzy objective functions
• Generalized penalization and maximization of vectorial nonsmooth functions

This page was built for publication: An exact minimax penalty function method and saddle point criteria for nonsmooth convex vector optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q289076)