LIPSCHITZr-INVEX FUNCTIONS AND NONSMOOTH PROGRAMMING
From MaRDI portal
Publication:3148350
DOI10.1081/NFA-120006693zbMath1103.49303OpenAlexW2013999391MaRDI QIDQ3148350
Publication date: 26 November 2002
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1081/nfa-120006693
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Nonsmooth analysis (49J52)
Related Items (11)
\(G\)-semipreinvexity and its applications ⋮ On optimality conditions and duality results in a class of nonconvex quasidifferentiable optimization problems ⋮ On semi-\((B, G)\)-preinvex functions ⋮ On minimax fractional programming problems involving generalized \((H_p,r)\)-invex functions ⋮ Nonsmooth minimax programming problems withV−r-invex functions ⋮ Vector exponential penalty function method for nondifferentiable multiobjective programming problems ⋮ Nonsmooth minimax programming under locally Lipschitz \((\Phi , \rho )\)-invexity ⋮ Unnamed Item ⋮ Optimality and invexity in optimization problems in Banach algebras (spaces) ⋮ (Φ, ρ)-Invexity in Nonsmooth Optimization ⋮ Optimality and duality in nonsmooth semi-infinite optimization, using a weak constraint qualification
Cites Work
- The essence of invexity
- On sufficiency of the Kuhn-Tucker conditions
- A subgradient duality theorem
- Refinements of necessary optimality conditions in nondifferentiable programming. I
- Symmetric dual nonlinear programs
- Nonsmooth invexity
- Optimization and nonsmooth analysis
- What is invexity?
- A duality theorem for non-linear programming
- Invex functions and constrained local minima
- On optimality conditions in nondifferentiable programming
- Generalized Nonsmooth Invexity
- r-convex functions
This page was built for publication: LIPSCHITZr-INVEX FUNCTIONS AND NONSMOOTH PROGRAMMING
