Optimization: Theory and Algorithms
This book is concerned with tangent cones, duality formulas, a generalized concept of conjugation, and the notion of maxi-minimizing sequence for a saddle-point problem, and deals more with algorithms in optimization. It focuses on the multiple exchange algorithm in convex programming.
1128337674
Optimization: Theory and Algorithms
This book is concerned with tangent cones, duality formulas, a generalized concept of conjugation, and the notion of maxi-minimizing sequence for a saddle-point problem, and deals more with algorithms in optimization. It focuses on the multiple exchange algorithm in convex programming.
225.49 In Stock
Optimization: Theory and Algorithms

Optimization: Theory and Algorithms

Optimization: Theory and Algorithms

Optimization: Theory and Algorithms

eBook

$225.49  $300.00 Save 25% Current price is $225.49, Original price is $300. You Save 25%.

Available on Compatible NOOK devices, the free NOOK App and in My Digital Library.
WANT A NOOK?  Explore Now

Related collections and offers


Overview

This book is concerned with tangent cones, duality formulas, a generalized concept of conjugation, and the notion of maxi-minimizing sequence for a saddle-point problem, and deals more with algorithms in optimization. It focuses on the multiple exchange algorithm in convex programming.

Product Details

ISBN-13: 9781000146363
Publisher: CRC Press
Publication date: 11/25/2020
Series: Lecture Notes in Pure and Applied Mathematics
Sold by: Barnes & Noble
Format: eBook
Pages: 272
File size: 73 MB
Note: This product may take a few minutes to download.

About the Author

Jean-Baptiste Hiriart-Urruty is a Professor of Mathematics at Universite Paul Sabatier, Toulouse France, Werner Oettli is a Professor of Mathematics at Universitat Mannhelm, Germany, Josef Stoer is a Professor of Applied Mathematics at Universitat Wurzburg, Germany.

Table of Contents

I: Theory 1. Hypertangent Cones for a Special Class of Sets 2. Optimization by Level Set Methods I : Duality Formulae 3. A Generalized Concept of Conjugation 4. Well-Posed Saddle Point Problems 5. Continuity Properties of Performance Functions 6. On a General Formulation of the Hahn-Banach Principle with Application to Optimization Theory 7. A Note on the Chebyshev e-Approximation Problem II: Algorithms 8. A Multiple Exchange Algorithm in Convex Programming 9. Algorithmes Pour Extraire Une Sous-Suite Convergente D'UNE Suite Non Convergente 10. The n-Step Square Convergence of Some Minimization Algorithms Related to Powell's Derivative Free Method III: Applications 11. Optimal Reconstruction of Surfaces Using Parametric Spline Functions 12. On the Penalty Method for Constrained Variational Inequalities 13. Bang-Bang-Controls for Time-Optimal Parabolic Boundary Control Problems with Integral State Constraints 14. Static and Dynamic Loads, Pointwise Constraint in Structural Optimization 15. Estimation and Control in Finite State Discounted Dynamic Programming
From the B&N Reads Blog

Customer Reviews