Quasi-optimization problems: existence, iterative algorithms and well-posedness

From MaRDI portal





Scalar optimization problems whose constraints depend explicitly on the unknown solution, called here quasi-optimization problems, are considered in a Banach space setting. Several existence theorems are proved, and first-order optimality conditions are derived. Two iterative algorithms for obtaining a solution are described. Forms of (Levitin-Polyak like) well-posedness of such problems are considered and criteria for such properties are proved.



Cites work









This page was built for publication: Quasi-optimization problems: existence, iterative algorithms and well-posedness

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