It is well-known that saddle point criteria is a sufficient optimality condition for constrained optimization problems. Convexity is a basic requirement for the development of duality theory and saddle point optimality. In this paper we show that, under some mild conditions, the local convexity of L
A new fast method to compute saddle-points in constrained optimization and applications
โ Scribed by Philippe Angot; Jean-Paul Caltagirone; Pierre Fabrie
- Book ID
- 113449243
- Publisher
- Elsevier Science
- Year
- 2012
- Tongue
- English
- Weight
- 278 KB
- Volume
- 25
- Category
- Article
- ISSN
- 0893-9659
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
The Vignes-La Porte CESTAC method enables the computer, when solving a problem in floating-point arithmetics (e.g., a system of equations), to construct 95% confidence intervals for the accuracy of the solution. In iterative methods, this involves the Optimal Stopping Criterion, which may be too cos
The International Conference on Intelligent Computing (ICIC) was formed to provide an annual forum dedicated to the emerging and challenging topics in artificial intel- gence, machine learning, pattern recognition, image processing, bioinformatics, and computational biology. It aims to bring togethe