Generalized sufficiency criteria in continuous-time programming with application to a class of variational-type inequalities

DOI10.1016/0022-247X(90)90217-4zbMath0718.49018OpenAlexW2088190562MaRDI QIDQ2639329

G. J. Zalmai

Publication date: 1990

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-247x(90)90217-4

zbMATH Keywords

pseudoinvexityreal Banach spacequasiinvexitysufficient conditions for optimalitycontinuous-time programmingFréchet differentiable functionsecond order sufficiency theorem

Mathematics Subject Classification ID

Related Items (18)

Relations between vector continuous-time program and vector variational-type inequality ⋮ A Study of Generalized Invex Functions on Riemannian Manifold ⋮ Second and higher order duality in Banach space under \(\rho-(\eta,\theta)\)-invexity ⋮ Second order duality for the variational problems under \(\rho - (\eta ,\theta )\)-invexity ⋮ On interval-valued optimization problems with generalized invex functions ⋮ Unnamed Item ⋮ Application of continuous-time programming problems to a class of variational-type inequalities ⋮ Sufficient optimality conditions and duality theorems for set-valued optimization problem under generalized cone convexity ⋮ Symmetric duality with \((p,r)-\rho -(\eta,\theta)\)-invexity ⋮ Multiobjective fractional programming problems involving \((p,r)\)-\(\rho\)-\((\eta,\theta)\)-invex function ⋮ Control problems under \((p,r)\)-\(\rho\)-\((\eta,\theta)\)-invexity ⋮ \(d-\rho -(\eta ,\theta )\)-invexity in multiobjective optimization ⋮ Optimality conditions and duality for a class of continuous-time programming problems with nonlinear operator equality and inequality constraints ⋮ Sufficiency and duality in non-smooth interval valued programming problems ⋮ Nonsmooth continuous-time optimization problems: Sufficient conditions ⋮ The continuous-time problem with interval-valued functions: applications to economic equilibrium ⋮ Optimality in continuous-time multiobjective optimization and vector variational-like inequalities ⋮ Second-order duality for invex composite optimization

Cites Work

• Optimality criteria in nonlinear programming involving nonconvex functions
• The essence of invexity
• Sufficient optimality conditions in continuous-time nonlinear programming
• Optimality conditions and Lagrangian duality in continuous-time nonlinear programming
• Sufficient Fritz John optimality conditions and duality for nonlinear programming problems
• Generalized Kuhn-Tucker conditions and duality for continuous nonlinear programming problems
• Optimality conditions and duality in continuous programming. I: Convex programs and a theorem of the alternative
• On sufficiency of the Kuhn-Tucker conditions
• Sufficient optimality criteria in continuous time programming
• Continuous time programming with nonlinear constraints
• A sufficient optimality criterion in continuous time programming for generalized convex functions
• Continuous time programming with nonlinear time-delayed constraints
• First and second order fractional programming duality
• A class of continuous convex programming problems
• Continuous programming. II: Nonlinear objectives
• Optimality conditions and duality for a class of continuous-time generalized fractional programming problems
• Strong and Weak Convexity of Sets and Functions
• What is invexity?
• Duality with generalized convexity
• Necessary and sufficient conditions in constrained optimization
• A class of continuous nonlinear programming problems with time‐delayed constraints
• Invex functions and constrained local minima
• Further Generalizations of Convexity in Mathematical Programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Generalized sufficiency criteria in continuous-time programming with application to a class of variational-type inequalities