(Φ, ρ)-Invexity in Nonsmooth Optimization

DOI10.1080/01630563.2010.526408zbMath1229.90133OpenAlexW2108019439MaRDI QIDQ3083512

Tadeusz Antczak, Aleksandra Stasiak

Publication date: 22 March 2011

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01630563.2010.526408

zbMATH Keywords

nonsmooth optimizationinvexitysufficient optimality conditionsMond-Weir duality

Mathematics Subject Classification ID

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

Related Items (13)

Multiobjective programming with new invexities ⋮ Sufficiency and duality for nonsmooth multiobjective fractional programming problems involving \((\Phi,\rho,\alpha)\)-\(V\)-invexity ⋮ Exactness of the absolute value penalty function method for nonsmooth ‐invex optimization problems ⋮ Sufficiency and duality for nonsmooth multiobjective programming problems involving generalized (\(\Phi\), \(\rho\))-\(V\)-type I functions ⋮ On nonsmooth semi-infinite minimax programming problem with \((\Phi, \rho)\)-invexity ⋮ Nonsmooth semi-infinite minmax programming involving generalized \((\varPhi,\rho)\)-invexity ⋮ Parametric nondifferentiable multiobjective fractional programming under (b;;; )-univexity ⋮ Nonsmooth minimax programming under locally Lipschitz \((\Phi , \rho )\)-invexity ⋮ Sufficiency and duality for multiobjective programming under new invexity ⋮ $$\varPhi -$$ Weak Slater Constraint Qualification in Nonsmooth Multiobjective Semi-infinite Programming ⋮ Proper efficiency conditions and duality results for nonsmooth vector optimization in Banach spaces under \((\varPhi, \rho)\)-invexity ⋮ Saddle point criteria and Wolfe duality in nonsmooth (Φ, ρ)-invex vector optimization problems with inequality and equality constraints ⋮ Optimality and duality in nonsmooth semi-infinite optimization, using a weak constraint qualification

Cites Work

• Equivalence of saddle-points and optima, and duality for a class of non- smooth non-convex problems
• On sufficiency of the Kuhn-Tucker conditions
• On efficiency and duality for multiobjective programs
• A subgradient duality theorem
• Refinements of necessary optimality conditions in nondifferentiable programming. I
• Symmetric dual nonlinear programs
• Strong and Weak Convexity of Sets and Functions
• LIPSCHITZr-INVEX FUNCTIONS AND NONSMOOTH PROGRAMMING
• Nonsmooth invexity
• Optimization and nonsmooth analysis
• What is invexity?
• On optimality conditions in nonsmooth inequality constrained minimization
• A class of nonconvex functions and mathematical programming
• Invex functions and constrained local minima
• Further Generalizations of Convexity in Mathematical Programming
• On sufficiency of the Kuhn-Tucker conditions in nondifferentiable programming
• On optimality conditions in nondifferentiable programming
• A New Approach to Lagrange Multipliers
• Generalized Nonsmooth Invexity
• ρ-Invex Functions and ( F , ρ)Convex Functions: Properties and Equivalences
• Generalized (F, ρ)-convexity and duality for non smooth multi-objective programs
• On duality theorems for nonsmooth Lipschitz optimization problems

This page was built for publication: (Φ, ρ)-Invexity in Nonsmooth Optimization