Subspace techniques for nonlinear optimization
From MaRDI portal
Publication:3632189
Recommendations
- A review on subspace methods for nonlinear optimization
- Subspace methods for large scale nonlinear equations and nonlinear least squares
- A subspace implementation of quasi-Newton trust region methods for unconstrained optimization
- Subspace trust-region algorithm with conic model for unconstrained optimization
- scientific article; zbMATH DE number 992793
Cited in
(16)- Numerical representations of a universal subspace flow for linear programs
- A null-space primal-dual interior-point algorithm for nonlinear optimization with nice convergence properties
- A Riemannian conjugate gradient method for optimization on the Stiefel manifold
- SABRINA: a stochastic subspace majorization-minimization algorithm
- The convergence of subspace trust region methods
- On subspace properties of the quadratically constrained quadratic program
- An optimal subgradient algorithm with subspace search for costly convex optimization problems
- Substructuring Methods in Nonlinear Function Spaces
- scientific article; zbMATH DE number 992793 (Why is no real title available?)
- Convergence of memory gradient methods
- A review on subspace methods for nonlinear optimization
- Nonstationary Consistency of Subspace Methods
- A simple sufficient descent method for unconstrained optimization
- A new two-dimensional model-based subspace method for large-scale unconstrained derivative-free optimization: 2D-MoSub
- Subspace methods for nonlinear optimization
- Subspace methods for large scale nonlinear equations and nonlinear least squares
This page was built for publication: Subspace techniques for nonlinear optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3632189)
