Modified Lagrangians and monotone maps in optimization
1.8 hrs read
Rate this book:
About This Book
This translation of the important Russian text covers the theory and computational methods of modified Lagrangian functions (MLFs) - a new branch of mathematical programming used to solve optimization problems.
Providing a thorough analysis for both traditional convex programming and monotone maps, the book shows the advantages of MLFs over classical Lagrangian functions in such practical applications as numerical algorithms, economic modeling, decomposition, and nonconvex local constrained optimization.
For mathematicians involved in discrete math and optimization, and for graduate students taking courses in complex analysis and mathematical programming, Modified Lagrangians and Monotone Maps in Optimization serves as an indispensable professional reference and graduate-level text that goes beyond the classical Lagrange scheme, and offers diverse techniques for tackling this field.
Providing a thorough analysis for both traditional convex programming and monotone maps, the book shows the advantages of MLFs over classical Lagrangian functions in such practical applications as numerical algorithms, economic modeling, decomposition, and nonconvex local constrained optimization.
For mathematicians involved in discrete math and optimization, and for graduate students taking courses in complex analysis and mathematical programming, Modified Lagrangians and Monotone Maps in Optimization serves as an indispensable professional reference and graduate-level text that goes beyond the classical Lagrange scheme, and offers diverse techniques for tackling this field.
Buy This Book
As an Amazon Associate and Bookshop.org affiliate, BookOrb earns from qualifying purchases.
Write a Review
Sign in to write a review.
More by E. G. Golʹshteĭn
Dualitätstheorie in der nichtl
Dualitätstheorie in der nichtlinearen Optimierung und ihre Anwendung
Modifit͡s︡irovannye funkt͡s︡ii
Modifit͡s︡irovannye funkt͡s︡ii Lagranzha
Vypukloe programmirovanie
Vypukloe programmirovanie
Zadachi lineĭnogo programmiro
Zadachi lineĭnogo programmirovanii͡a︡ transportnogo tipa