A second order -approximation method for constrained optimization problems involving second order invex functions.
From MaRDI portal
(Redirected from Publication:993312)
A second order \(\eta \)-approximation method for constrained optimization problems involving second order invex functions.
A second order \(\eta \)-approximation method for constrained optimization problems involving second order invex functions.
Recommendations
- Saddle points criteria via a second order \(\eta \)-approximation approach for nonlinear mathematical programming involving second order invex functions
- A Modified Objective Function Method in Mathematical Programming with Second Order Invexity
- Saddle point criteria for second order \(\eta\)-approximated vector optimization problems.
- An η-Approximation Approach for Nonlinear Mathematical Programming Problems Involving Invex Functions
- Saddle-point criteria in an \(\eta\)-approximation method for nonlinear mathematical programming problems involving invex functions
Cites work
- scientific article; zbMATH DE number 4010221 (Why is no real title available?)
- (Generalized) bonvexity and higher order duality for fractional programming
- An η-Approximation Approach for Nonlinear Mathematical Programming Problems Involving Invex Functions
- Invex functions and constrained local minima
- On sufficiency of the Kuhn-Tucker conditions
- Second-order and related extremality conditions in nonlinear programming
- The essence of invexity
- What is invexity?
Cited in
(7)- Second order convexity and a modified objective function method in mathematical programming
- Saddle points criteria via a second order \(\eta \)-approximation approach for nonlinear mathematical programming involving second order invex functions
- Second order \((\Phi, \rho)\)-\(V\)-invexity and duality for semi-infinite minimax fractional programming
- On second-order generalized convexity
- Saddle point criteria for second order \(\eta\)-approximated vector optimization problems.
- A Modified Objective Function Method in Mathematical Programming with Second Order Invexity
- On equivalence between a variational problem and its modified variational problem with the η‐objective function under invexity
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)