A second order \(\eta \)-approximation method for constrained optimization problems involving second order invex functions.

DOI10.1007/s10492-009-0028-2zbMath1212.90307OpenAlexW2082756863MaRDI QIDQ993312

Tadeusz Antczak

Publication date: 10 September 2010

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

Full work available at URL: https://eudml.org/doc/37831

zbMATH Keywords

second order optimality conditionssecond order \(\eta \)-approximated optimization problemsecond order invex function

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)

Related Items

On second-order generalized convexity, Unnamed Item, Second order \((\Phi, \rho)\)-\(V\)-invexity and duality for semi-infinite minimax fractional programming, On equivalence between a variational problem and its modified variational problem with the η‐objective function under invexity

Cites Work

• Unnamed Item
• Second-order and related extremality conditions in nonlinear programming
• The essence of invexity
• (Generalized) bonvexity and higher order duality for fractional programming
• On sufficiency of the Kuhn-Tucker conditions
• What is invexity?
• Invex functions and constrained local minima
• An η-Approximation Approach for Nonlinear Mathematical Programming Problems Involving Invex Functions