Lagrange multiplier theory provides a tool for the analysis of a general class of nonlinear variational problems and is the basis for developing efficient and powerful iterative methods for solving these problems. This comprehensive monograph analyzes Lagrange multiplier theory and shows its impact on the development of numerical algorithms for problems posed in a function space setting. The book is motivated by the idea that a full treatment of a variational problem in function spaces would not be complete without a discussion of infinite-dimensional analysis, proper discretization, and the relationship between the two. The authors develop and analyze efficient algorithms for constrained optimization and convex optimization problems based on the augumented Lagrangian concept and cover such topics as sensitivity analysis, convex optimization, second order methods, and shape sensitivity calculus. General theory is applied to challenging problems in optimal control of partial differential equations, image analysis, mechanical contact and friction problems, and American options for the Black-Scholes model. Audience: This book is for researchers in optimization and control theory, numerical PDEs, and applied analysis. It will also be of interest to advanced graduate students in applied analysis and PDE optimization.
Cited By
- Zhang Y, Song X, Yu B and Ding M (2024). An iDCA with Sieving Strategy for PDE-Constrained Optimization Problems with -Control Cost, Journal of Scientific Computing, 99:1, Online publication date: 1-Apr-2024.
- Paganini A and Wechsung F (2021). Fireshape: a shape optimization toolbox for Firedrake, Structural and Multidisciplinary Optimization, 63:5, (2553-2569), Online publication date: 1-May-2021.
- Karl V, Neitzel I and Wachsmuth D (2020). A Lagrange multiplier method for semilinear elliptic state constrained optimal control problems, Computational Optimization and Applications, 77:3, (831-869), Online publication date: 1-Dec-2020.
- Dabaghi J, Martin V and Vohralík M (2020). Adaptive Inexact Semismooth Newton Methods for the Contact Problem Between Two Membranes, Journal of Scientific Computing, 84:2, Online publication date: 3-Aug-2020.
- Hassani H, Machado J, Avazzadeh Z, Naraghirad E and Dahaghin M (2020). Generalized Bernoulli Polynomials: Solving Nonlinear 2D Fractional Optimal Control Problems, Journal of Scientific Computing, 83:2, Online publication date: 13-May-2020.
- Chen H and Huang Q (2020). Preconditioned iterative method for boundary value method discretizations of a parabolic optimal control problem, Calcolo: a quarterly on numerical analysis and theory of computation, 57:1, Online publication date: 1-Jan-2020.
- Börgens E and Kanzow C (2019). Regularized Jacobi-type ADMM-methods for a class of separable convex optimization problems in Hilbert spaces, Computational Optimization and Applications, 73:3, (755-790), Online publication date: 1-Jul-2019.
- Herzog R, Pearson J and Stoll M (2019). Fast iterative solvers for an optimal transport problem, Advances in Computational Mathematics, 45:2, (495-517), Online publication date: 1-Apr-2019.
- Meyer C and Sievers M (2019). Finite element discretization of local minimization schemes for rate-independent evolutions, Calcolo: a quarterly on numerical analysis and theory of computation, 56:1, (1-38), Online publication date: 1-Mar-2019.
- Chen J and Rabitz H (2019). On Lifting Operators and Regularity of Nonsmooth Newton Methods for Optimal Control Problems of Differential Algebraic Equations, Journal of Optimization Theory and Applications, 180:2, (518-535), Online publication date: 1-Feb-2019.
- Ghilli D and Kunisch K (2019). On monotone and primal-dual active set schemes for $$\ell ^p$$ℓp-type problems, $$p \in (0,1]$$p?(0,1], Computational Optimization and Applications, 72:1, (45-85), Online publication date: 1-Jan-2019.
- Clason C, Do T and Pörner F (2018). Error estimates for the approximation of multibang control problems, Computational Optimization and Applications, 71:3, (857-878), Online publication date: 1-Dec-2018.
- Braack M, Quaas M, Tews B and Vexler B (2018). Optimization of Fishing Strategies in Space and Time as a Non-convex Optimal Control Problem, Journal of Optimization Theory and Applications, 178:3, (950-972), Online publication date: 1-Sep-2018.
- Liu S, Lin Y, Zhou Z, Nan K, Liu H and Du J On-Demand Deep Model Compression for Mobile Devices Proceedings of the 16th Annual International Conference on Mobile Systems, Applications, and Services, (389-400)
- Li J, Wang X and Zhang K (2018). An efficient alternating direction method of multipliers for optimal control problems constrained by random Helmholtz equations, Numerical Algorithms, 78:1, (161-191), Online publication date: 1-May-2018.
- Carraro T, Dörsam S, Frei S and Schwarz D (2018). An Adaptive Newton Algorithm for Optimal Control Problems with Application to Optimal Electrode Design, Journal of Optimization Theory and Applications, 177:2, (498-534), Online publication date: 1-May-2018.
- Klatte D and Kummer B (2018). Approximations and generalized Newton methods, Mathematical Programming: Series A and B, 168:1-2, (673-716), Online publication date: 1-Mar-2018.
- Pearson J and Gondzio J (2017). Fast interior point solution of quadratic programming problems arising from PDE-constrained optimization, Numerische Mathematik, 137:4, (959-999), Online publication date: 1-Dec-2017.
- Porcelli M, Simoncini V and Stoll M (2017). Preconditioning PDE-constrained optimization with L1-sparsity and control constraints, Computers & Mathematics with Applications, 74:5, (1059-1075), Online publication date: 1-Sep-2017.
- Allendes A, Otárola E, Rankin R and Salgado A (2017). Adaptive finite element methods for an optimal control problem involving Dirac measures, Numerische Mathematik, 137:1, (159-197), Online publication date: 1-Sep-2017.
- Jin Q (2017). On a heuristic stopping rule for the regularization of inverse problems by the augmented Lagrangian method, Numerische Mathematik, 136:4, (973-992), Online publication date: 1-Aug-2017.
- Atanacković T, Janev M, Pilipović S and Zorica D (2017). Euler---Lagrange Equations for Lagrangians Containing Complex-order Fractional Derivatives, Journal of Optimization Theory and Applications, 174:1, (256-275), Online publication date: 1-Jul-2017.
- Bredies K and Sun H (2017). A Proximal Point Analysis of the Preconditioned Alternating Direction Method of Multipliers, Journal of Optimization Theory and Applications, 173:3, (878-907), Online publication date: 1-Jun-2017.
- Barnard R and Clason C (2017). $$L^1$$L1 penalization of volumetric dose objectives in optimal control of PDEs, Computational Optimization and Applications, 67:2, (401-419), Online publication date: 1-Jun-2017.
- Liu J and Xiao M (2016). A leapfrog multigrid algorithm for the optimal control of parabolic PDEs with Robin boundary conditions, Journal of Computational and Applied Mathematics, 307:C, (216-234), Online publication date: 1-Dec-2016.
- Mang A, Gholami A and Biros G Distributed-memory large deformation diffeomorphic 3D image registration Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, (1-12)
- Sun S, Peng Q and Zhang X (2016). Global feature selection from microarray data using Lagrange multipliers, Knowledge-Based Systems, 110:C, (267-274), Online publication date: 15-Oct-2016.
- Cibulka R and Dontchev A (2016). A nonsmooth Robinson's inverse function theorem in Banach spaces, Mathematical Programming: Series A and B, 156:1-2, (257-270), Online publication date: 1-Mar-2016.
- Dolgov S, Pearson J, Savostyanov D and Stoll M (2016). Fast tensor product solvers for optimization problems with fractional differential equations as constraints, Applied Mathematics and Computation, 273:C, (604-623), Online publication date: 15-Jan-2016.
- Filieri A, Grunske L and Leva A Lightweight adaptive filtering for efficient learning and updating of probabilistic models Proceedings of the 37th International Conference on Software Engineering - Volume 1, (200-211)
- Hintermüller M and Rasch J (2015). Several path-following methods for a class of gradient constrained variational inequalities, Computers & Mathematics with Applications, 69:10, (1045-1067), Online publication date: 1-May-2015.
- Zeng M and Zhang G (2015). Preconditioning optimal control of the unsteady Burgers equations with H 1 regularized term, Applied Mathematics and Computation, 254:C, (133-147), Online publication date: 1-Mar-2015.
- Negri F, Manzoni A and Rozza G (2015). Reduced basis approximation of parametrized optimal flow control problems for the Stokes equations, Computers & Mathematics with Applications, 69:4, (319-336), Online publication date: 1-Feb-2015.
- Fan Y, Litven J and Pai D (2014). Active volumetric musculoskeletal systems, ACM Transactions on Graphics, 33:4, (1-9), Online publication date: 27-Jul-2014.
- Kröner A and Kunisch K (2014). A minimum effort optimal control problem for the wave equation, Computational Optimization and Applications, 57:1, (241-270), Online publication date: 1-Jan-2014.
- Kunisch K and Lu X (2013). Optimal control for elliptic systems with pointwise euclidean norm constraints on the controls, Mathematical Programming: Series A and B, 142:1-2, (461-483), Online publication date: 1-Dec-2013.
- Sawatzky A, Tenbrinck D, Jiang X and Burger M (2013). A Variational Framework for Region-Based Segmentation Incorporating Physical Noise Models, Journal of Mathematical Imaging and Vision, 47:3, (179-209), Online publication date: 1-Nov-2013.
- Amstutz S and Laurain A (2013). A semismooth Newton method for a class of semilinear optimal control problems with box and volume constraints, Computational Optimization and Applications, 56:2, (369-403), Online publication date: 1-Oct-2013.
- Jiménez B, Novo V and Sama M (2013). An extension of the Basic Constraint Qualification to nonconvex vector optimization problems, Journal of Global Optimization, 56:4, (1755-1771), Online publication date: 1-Aug-2013.
- Fan Y, Litven J, Levin D and Pai D (2013). Eulerian-on-lagrangian simulation, ACM Transactions on Graphics, 32:3, (1-9), Online publication date: 1-Jun-2013.
- Ito K, Jin B and Zou J (2013). A two-stage method for inverse medium scattering, Journal of Computational Physics, 237, (211-223), Online publication date: 1-Mar-2013.
- Rodríguez-Marín L and Sama M (2013). Scalar Lagrange Multiplier Rules for Set-Valued Problems in Infinite-Dimensional Spaces, Journal of Optimization Theory and Applications, 156:3, (683-700), Online publication date: 1-Mar-2013.
- Langer A, Osher S and Schönlieb C (2013). Bregmanized Domain Decomposition for Image Restoration, Journal of Scientific Computing, 54:2-3, (549-576), Online publication date: 1-Feb-2013.
- Yousept I (2012). Finite Element Analysis of an Optimal Control Problem in the Coefficients of Time-Harmonic Eddy Current Equations, Journal of Optimization Theory and Applications, 154:3, (879-903), Online publication date: 1-Sep-2012.
- Clason C and Kunisch K (2012). A measure space approach to optimal source placement, Computational Optimization and Applications, 53:1, (155-171), Online publication date: 1-Sep-2012.
- Butt M and Borzì A (2011). Formulation and multigrid solution of Cauchy-Riemann optimal control problems, Computing and Visualization in Science, 14:2, (79-90), Online publication date: 1-Feb-2011.
Index Terms
- Lagrange Multiplier Approach to Variational Problems and Applications
Recommendations
Lagrangian Duality and Related Multiplier Methods for Variational Inequality Problems
We consider a new class of multiplier interior point methods for solving variational inequality problems with maximal monotone operators and explicit convex constraint inequalities. Developing a simple Lagrangian duality scheme which is combined with ...
On the multiplier-penalty-approach for quasi-variational inequalities
The multiplier-penalty approach is one of the classical methods for the solution of constrained optimization problems. This method was generalized to the solution of quasi-variational inequalities by Pang and Fukushima (Comput Manag Sci 2:21---56, 2005)...
A Sharp Lagrange Multiplier Rule for Nonsmooth Mathematical Programming Problems Involving Equality Constraints
It is shown that a Lagrange multiplier rule that uses approximate Jacobians holds for mathematical programming problems involving Lipschitzian functions, finitely many equality constraints, and convex set constraints. It is sharper than the ...