Saddle-point criteria in an -approximation method for nonlinear mathematical programming problems involving invex functions
DOI10.1007/S10957-006-9069-9zbMATH Open1138.90027OpenAlexW2080323706MaRDI QIDQ995949FDOQ995949
Authors: Tadeusz Antczak 
Publication date: 10 September 2007
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-006-9069-9
Recommendations
- Saddle points criteria via a second order \(\eta \)-approximation approach for nonlinear mathematical programming involving second order invex functions
- scientific article; zbMATH DE number 5879517
- An η-Approximation Approach for Nonlinear Mathematical Programming Problems Involving Invex Functions
- Saddle points criteria in nondifferentiable multiobjective programming with \(V\)-invex functions via an \(\eta \)-approximation method
- Saddle point criteria for semi-infinite programming problems via an \(\eta\)-approximation method
Optimality conditions and duality in mathematical programming (90C46) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)
Cites Work
- Convex Analysis
- On sufficiency of the Kuhn-Tucker conditions
- A linearization approach to multiobjective programming duality
- What is invexity?
- Invex functions and constrained local minima
- Nonlinear Programming
- An η-Approximation Approach for Nonlinear Mathematical Programming Problems Involving Invex Functions
- On the gap functions of prevariational inequalities
Cited In (17)
- Duality for a fractional variational formulation using $\eta$-approximated method
- Saddle point criteria and duality in multiobjective programming via an η-approximation method
- G-saddle point criteria andG-Wolfe duality in differentiate mathematical programming
- On equivalence between a variational problem and its modified variational problem with the η‐objective function under invexity
- Saddle point criteria and the exact minimax penalty function method in nonconvex programming
- An η-Approximation Approach for Nonlinear Mathematical Programming Problems Involving Invex Functions
- A second order \(\eta \)-approximation method for constrained optimization problems involving second order invex functions.
- Saddle point criteria for second order \(\eta\)-approximated vector optimization problems.
- Saddle points criteria via a second order \(\eta \)-approximation approach for nonlinear mathematical programming involving second order invex functions
- Title not available (Why is that?)
- Optimality and duality in vector optimization involving generalized type I functions over cones
- Saddle points criteria in nondifferentiable multiobjective programming with \(V\)-invex functions via an \(\eta \)-approximation method
- An \(\eta\)-approximation approach to duality in mathematical programming problems involving \(r\)-invex functions
- Saddle point criteria and Wolfe duality in nonsmooth (Φ, ρ)-invex vector optimization problems with inequality and equality constraints
- Saddle point criteria for semi-infinite programming problems via an \(\eta\)-approximation method
- Saddle-point optimality criteria involving (p, b, d)-invexity and (p, b, d)-pseudoinvexity in interval-valued optimisation problems
- On the relationships between \(G\)-preinvex functions and semistrictly \(G\)-preinvex functions
This page was built for publication: Saddle-point criteria in an \(\eta\)-approximation method for nonlinear mathematical programming problems involving invex functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q995949)
