Multilevel Algorithms for Constrained Compact Fixed Point Problems
From MaRDI portal
Recommendations
Cited in
(15)- Adjoint-based Monte Carlo calibration of financial methods
- A new preconditioned Richardson iterative method
- Global convergence of inexact reduced sqp methods
- Fast Algorithms for Compact Fixed Point Problems with Inexact Function Evaluations
- A sequential homotopy method for mathematical programming problems
- Primal-dual interior-point methods for PDE-constrained optimization
- Fast interior point solution of quadratic programming problems arising from PDE-constrained optimization
- Numerical methods for nonlinear equations
- On convergence of a receding horizon method for parabolic boundary control
- Validation and enclosure of solutions of linear complementarity problems
- Globally convergent algorithms for nonsmooth nonlinear equations in computational fluid dynamics.
- Properties of a class of multilevel optimization algorithms for equality-constrained problems
- On the multilevel nonlinear problem and its convergence algorithms
- Two-grid methods for nonlinear multi-dimensional weakly singular integral equations
- On a lagrange — Newton method for a nonlinear parabolic boundary control problem∗
This page was built for publication: Multilevel Algorithms for Constrained Compact Fixed Point Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4296198)