Complexity analysis of regularization methods for implicitly constrained least squares
From MaRDI portal
Publication:6635781
DOI10.1007/s10915-024-02691-2MaRDI QIDQ6635781
Publication date: 12 November 2024
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Mathematical programming (90Cxx) Numerical methods in optimal control (49Mxx) Numerical methods for mathematical programming, optimization and variational techniques (65Kxx)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Reduced basis approximation and a posteriori error estimation for the time-dependent viscous Burgers' equation
- Deep neural networks motivated by partial differential equations
- Adaptive regularization with cubics on manifolds
- Convergence and complexity analysis of a Levenberg-Marquardt algorithm for inverse problems
- Convergence and evaluation-complexity analysis of a regularized tensor-Newton method for solving nonlinear least-squares problems
- A comparison of algorithms for control constrained optimal control of the Burgers equation
- On the Evaluation Complexity of Cubic Regularization Methods for Potentially Rank-Deficient Nonlinear Least-Squares Problems and Its Relevance to Constrained Nonlinear Optimization
- Finite Elements and Fast Iterative Solvers
- A Matrix-Free Trust-Region SQP Method for Equality Constrained Optimization
- Optimization with PDE Constraints
- An implicit trust-region method on Riemannian manifolds
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- The SQP method for control constrained optimal control of the Burgers equation
- Complexity Analysis of Second-Order Line-Search Algorithms for Smooth Nonconvex Optimization
- An Introduction to Optimization on Smooth Manifolds
- A Stochastic Levenberg--Marquardt Method Using Random Models with Complexity Results
- Evaluation Complexity of Algorithms for Nonconvex Optimization: Theory, Computation and Perspectives
- Trust-Region Newton-CG with Strong Second-Order Complexity Guarantees for Nonconvex Optimization
- TTRISK: Tensor train decomposition algorithm for risk averse optimization
This page was built for publication: Complexity analysis of regularization methods for implicitly constrained least squares
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6635781)