A second order -approximation method for constrained optimization problems involving second order invex functions.
DOI10.1007/S10492-009-0028-2zbMATH Open1212.90307OpenAlexW2082756863MaRDI QIDQ993312FDOQ993312
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
second order optimality conditionssecond order \(\eta \)-approximated optimization problemsecond order invex function
Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)
Cites Work
- Title not available (Why is that?)
- On sufficiency of the Kuhn-Tucker conditions
- What is invexity?
- Invex functions and constrained local minima
- The essence of invexity
- (Generalized) bonvexity and higher order duality for fractional programming
- Second-order and related extremality conditions in nonlinear programming
- An η-Approximation Approach for Nonlinear Mathematical Programming Problems Involving Invex Functions
Cited In (4)
- Title not available (Why is that?)
- On second-order generalized convexity
- On equivalence between a variational problem and its modified variational problem with the η‐objective function under invexity
- Second order \((\Phi, \rho)\)-\(V\)-invexity and duality for semi-infinite minimax fractional programming
This page was built for publication: A second order \(\eta \)-approximation method for constrained optimization problems involving second order invex functions.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q993312)
