Algorithms Based on Abs-Linearization for Non-smooth Optimization with PDE Constraints
From MaRDI portal
Publication:5051784
DOI10.1007/978-3-030-79393-7_15OpenAlexW4212881971MaRDI QIDQ5051784
Andrea Walther, Olga Weiß, Stephan Schmidt
Publication date: 18 November 2022
Published in: International Series of Numerical Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-79393-7_15
Related Items
Uses Software
Cites Work
- A bundle-free implicit programming approach for a class of elliptic MPECs in function space
- Automated solution of differential equations by the finite element method. The FEniCS book
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- Primal-dual interior-point methods for PDE-constrained optimization
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- A non-linear eigenvalue problem: the shape at equilibrium of a confined plasma
- Lipschitz continuity of the absolute value and Riesz projections in symmetric operator spaces
- Optimal control of a non-smooth semilinear elliptic equation
- Applied functional analysis. Applications to mathematical physics. Vol. 1
- An algorithm for nonsmooth optimization by successive piecewise linearization
- On stable piecewise linearization and generalized algorithmic differentiation
- The Split Bregman Method for L1-Regularized Problems
- Introduction to the Theory of Nonlinear Optimization
- Finite element approximation of a nonlinear eigenvalue problem related to MHD equilibria
- On the Convergence of the Proximal Point Algorithm for Convex Minimization
- Monotone Operators and the Proximal Point Algorithm
- A New Approach to Lagrange Multipliers
- Relaxing Kink Qualifications and Proving Convergence Rates in Piecewise Smooth Optimization
- Optimality Conditions and Error Analysis of Semilinear Elliptic Control Problems with $L^1$ Cost Functional
- Fast Alternating Direction Optimization Methods
- Convergence of the Iterates of Descent Methods for Analytic Cost Functions
- Nonsmooth optimization by successive abs-linearization in function spaces
- Unnamed Item
- Unnamed Item
