Computational Optimization: A Tribute to Olvi Mangasarian Volume I
Editat de Jong-Shi Pangen Limba Engleză Paperback – 4 oct 2012
This collection of papers covers a wide spectrum of computational optimization topics, representing a blend of familiar nonlinear programming topics and such novel paradigms as semidefinite programming and complementarity-constrained nonlinear programs. Many new results are presented in these papers which are bound to inspire further research and generate new avenues for applications. An informal categorization of the papers includes:
- Algorithmic advances for special classes of constrained optimization problems
- Analysis of linear and nonlinear programs
- Algorithmic advances
- B- stationary points of mathematical programs with equilibrium constraints
- Applications of optimization
- Some mathematical topics
- Systems of nonlinear equations.
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (1) | 943.57 lei 43-57 zile | |
Springer Us – 4 oct 2012 | 943.57 lei 43-57 zile | |
Hardback (1) | 949.55 lei 43-57 zile | |
Springer Us – 31 mai 1999 | 949.55 lei 43-57 zile |
Preț: 943.57 lei
Preț vechi: 1150.70 lei
-18% Nou
Puncte Express: 1415
Preț estimativ în valută:
180.61€ • 196.25$ • 151.81£
180.61€ • 196.25$ • 151.81£
Carte tipărită la comandă
Livrare economică 21 aprilie-05 mai
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9781461373674
ISBN-10: 1461373670
Pagini: 276
Ilustrații: 273 p.
Dimensiuni: 155 x 235 x 14 mm
Greutate: 0.39 kg
Ediția:Softcover reprint of the original 1st ed. 1999
Editura: Springer Us
Colecția Springer
Locul publicării:New York, NY, United States
ISBN-10: 1461373670
Pagini: 276
Ilustrații: 273 p.
Dimensiuni: 155 x 235 x 14 mm
Greutate: 0.39 kg
Ediția:Softcover reprint of the original 1st ed. 1999
Editura: Springer Us
Colecția Springer
Locul publicării:New York, NY, United States
Public țintă
ResearchCuprins
Guest Editorial.- Solving Euclidean Distance Matrix Completion Problems Via Semidefinite Programming.- A Logarithmic-Quadratic Proximal Method for Variational Inequalities.- A Note on Error Bounds for Convex and Nonconvex Programs.- Multicategory Classification by Support Vector Machines.- Quartic Barriers.- A Partitioned ?-Relaxation Algorithm for Separable Convex Network Flow Problems.- On a Primal-Dual Analystic Center Cutting Plane Method for Variational Inequalities.- A Shifted-Barrier Primal-Dual Algorithm Model for Linearly Constrained Optimization Problems.- Arithmetic Continuation of Regular Roots of Formal Parametric Polynomial Systems.- Interfaces to PATH 3.0: Design, Implementation and Usage.- Existence and Limiting Behavior of Trajectories Associated with Po-equations.- Stabilized Sequential Quadratic Programming.