Abstract
Questions of existence of solutions and how they depend on a problem’s parameters are usually important for many problems of mathematics, not only in optimization. The term well-posedness refers to the existence and uniqueness of a solution and its continuous behavior with respect to data perturbations, which is referred to as stability. In general, a problem is said to be stable if
where δ is a given tolerance of the problem’s data, ε(δ) is the accuracy with which the solution can be determined, and ε(δ) is a continuous function of δ. Besides these conditions, accompanying robustness properties in the convergence of sequence of approximate solutions are also required.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Stefanov, S.M. (2001). Well-Posedness of Optimization Problems. On the Stability of the Set of Saddle Points of the Lagrangian. In: Separable Programming. Applied Optimization, vol 53. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-3417-1_9
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3417-1_9
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4851-9
Online ISBN: 978-1-4757-3417-1
eBook Packages: Springer Book Archive