The l₁ exact exponential penalty function method with (p,r)--(,)-invexity

zbMATH Open1275.90067MaRDI QIDQ3166147FDOQ3166147

Payel Mandal, Chandal Nahak

Publication date: 21 October 2012

Recommendations

• A new exact exponential penalty function method and nonconvex mathematical programming
• Variational problems and \(l_1\) exact exponential penalty function with \((p,r)-\rho-(\eta,\theta)\)-invexity
• An exact \(l_1\) exponential penalty function method for multiobjective optimization problems with exponential-type invexity
• Exact penalty functions method for mathematical programming problems involving invex functions
• The Exact l 1 Penalty Function Method for Constrained Nonsmooth Invex Optimization Problems

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Cited In (5)

• The Exact l 1 Penalty Function Method for Constrained Nonsmooth Invex Optimization Problems
• On the exactness and the convergence of the \(l_1\) exact penalty \(E\)-function method for \(E\)-differentiable optimization problems
• An exact minimax penalty function method and saddle point criteria for nonsmooth convex vector optimization problems
• An exact \(l_1\) exponential penalty function method for multiobjective optimization problems with exponential-type invexity
• The exact absolute value penalty function method for identifying strict global minima of order \(m\) in nonconvex nonsmooth programming

This page was built for publication: The \(l_1\) exact exponential penalty function method with \((p,r)-\rho-(\eta,\theta)\)-invexity

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