Continuous time non-smooth optimization through quasi efficiency

DOI10.2478/CANDC-2023-0038MaRDI QIDQ6633657zbMATH OpenFDO

Authors Promila Kumar, Bharti Sharma

Publication date 6 November 2024

Published in Control and Cybernetics (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

zbMATH Keywords

dualityoptimality conditionsapproximate convexityquasi efficiencycontinuous time problem

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Nonsmooth analysis (49J52)

Recommendations

• Proper efficiency conditions and duality models for a class of nonsmooth continuous-time multiobjective programming problems
• Proper efficiency conditions and duality models for a class of nonsmooth continuous-time multiobjective fractional programming problems
• Nonsmooth multiobjective continuous-time problems with generalized invexity
• Optimality conditions and duality for a class of continuous-time programming problems with nonlinear operator equality and inequality constraints
• Necessary and sufficient conditions for weak quasi Efficiency in nonsmooth multiobjective problems

Cites work

• Approximate convexity in vector optimisation
• Approximate solutions of multiobjective optimization problems
• Bottleneck Problems and Dynamic Programming
• Continuous time programming with nonlinear constraints
• Duality for nonsmooth continuous-time problems of vector optimization
• Generalized Kuhn-Tucker conditions and duality for continuous nonlinear programming problems
• Necessary conditions for ε-optimality
• Nonsmooth continuous-time optimization problems: Necessary conditions
• Nonsmooth continuous-time optimization problems: Sufficient conditions
• Nonsmooth multiobjective problems and generalized vector variational inequalities using quasi-efficiency
• On relations between nonsmooth interval-valued multiobjective programming problems and generalized Stampacchia vector variational inequalities
• Optimality conditions and Lagrangian duality in continuous-time nonlinear programming
• Optimality conditions and duality in continuous programming. II: The linear problem revisited
• Optimality criteria for nonsmooth continuous-time problems of multiobjective optimization
• Optimality via generalized approximate convexity and quasiefficiency
• Optimization and nonsmooth analysis
• Some relations between vector variational inequality problems and nonsmooth vector optimization problems using quasi efficiency
• The Fritz John and Kuhn-Tucker optimality conditions in continuous-time nonlinear programming
• \(\epsilon\)-solutions in vector minimization problems

This page was built for publication: Continuous time non-smooth optimization through quasi efficiency

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6633657)