Complexity analysis of regularization methods for implicitly constrained least squares

DOI10.1007/S10915-024-02691-2MaRDI QIDQ6635781zbMATH OpenFDO

Authors Akwum Onwunta, C. W. Royer

Publication date 12 November 2024

Published in Journal of Scientific Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10915-024-02691-2

zbMATH Keywords

PDE-constrained optimizationnonlinear least squaresimplicit constraintscomplexity guarantees

Mathematics Subject Classification ID

Numerical methods in optimal control (49Mxx) Mathematical programming (90Cxx) Numerical methods for mathematical programming, optimization and variational techniques (65Kxx)

Cites work

• scientific article; zbMATH DE number 5703572 (Why is no real title available?)
• scientific article; zbMATH DE number 5937962 (Why is no real title available?)
• scientific article; zbMATH DE number 5060482 (Why is no real title available?)
• A comparison of algorithms for control constrained optimal control of the Burgers equation
• A matrix-free trust-region SQP method for equality constrained optimization
• A stochastic Levenberg-Marquardt method using random models with complexity results
• Adaptive regularization with cubics on manifolds
• An Introduction to Optimization on Smooth Manifolds
• An implicit trust-region method on Riemannian manifolds
• Complexity analysis of second-order line-search algorithms for smooth nonconvex optimization
• 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
• Deep neural networks motivated by partial differential equations
• Evaluation complexity of algorithms for nonconvex optimization. Theory, computation and perspectives
• Finite elements and fast iterative solvers. With applications in incompressible fluid dynamics
• LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
• On the evaluation complexity of cubic regularization methods for potentially rank-deficient nonlinear least-squares problems and its relevance to constrained nonlinear optimization
• Optimization with PDE Constraints
• Reduced basis approximation and a posteriori error estimation for the time-dependent viscous Burgers' equation
• TTRISK: Tensor train decomposition algorithm for risk averse optimization
• The SQP method for control constrained optimal control of the Burgers equation
• Trust-region Newton-CG with strong second-order complexity guarantees for nonconvex 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)