Saddle point criteria and the exact minimax penalty function method in nonconvex programming

DOI10.11650/TJM.17.2013.1823zbMath1279.49022OpenAlexW2093969563MaRDI QIDQ390035

Tadeusz Antczak

Publication date: 22 January 2014

Published in: Taiwanese Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.11650/tjm.17.2013.1823

zbMATH Keywords

saddle pointinvex functionexact minimax penalty function methodminimax penalized optimization problem

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Related Items (2)

An exact \(l_1\) penalty approach for interval-valued programming problem ⋮ An exact minimax penalty function method and saddle point criteria for nonsmooth convex vector optimization problems

This page was built for publication: Saddle point criteria and the exact minimax penalty function method in nonconvex programming