A block Lanczos method for the extended trust-region subproblem
From MaRDI portal
Recommendations
- Refined bounds on the convergence of block Lanczos method for extended trust-region subproblem
- The convergence of the generalized Lanczos trust-region method for the trust-region subproblem
- A block Lanczos method for the CDT subproblem
- Error bounds of Lanczos approach for trust-region subproblem
- A Nested Lanczos Method for the Trust-Region Subproblem
Cites work
- A necessary and sufficient condition of convexity for SOC reformulation of trust-region subproblem with two intersecting cuts
- A review on subspace methods for nonlinear optimization
- A second-order cone based approach for solving the trust-region subproblem and its variants
- A semidefinite framework for trust region subproblems with applications to large scale minimization
- A subspace implementation of quasi-Newton trust region methods for unconstrained optimization
- A Subspace Minimization Method for the Trust-Region Step
- Approximate solution of the trust region problem by minimization over two-dimensional subspaces
- Convergence of ADMM for multi-block nonconvex separable optimization models
- Dealing with linear dependence during the iterations of the restarted block Lanczos methods
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- scientific article; zbMATH DE number 1049350 (Why is no real title available?)
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- Implementation Aspects of Band Lanczos Algorithms for Computation of Eigenvalues of Large Sparse Symmetric Matrices
- Local nonglobal minima for solving large-scale extended trust-region subproblems
- Metric Regularity and Constraint Qualifications for Convex Inequalities on Banach Spaces
- New Results on Quadratic Minimization
- Normal fans of polyhedral convex sets
- On Cones of Nonnegative Quadratic Functions
- On Projection Algorithms for Solving Convex Feasibility Problems
- On the convergence of the direct extension of ADMM for three-block separable convex minimization models with one strongly convex function
- On the generalized Lanczos trust-region method
- Polynomial Solvability of Variants of the Trust-Region Subproblem
- Recent advances in trust region algorithms
- Regularities and their relations to error bounds
- Robust optimization
- Second-order-cone constraints for extended trust-region subproblems
- Solving the trust-region subproblem by a generalized eigenvalue problem
- Solving the Trust-Region Subproblem using the Lanczos Method
- Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization
- Strong Duality for the CDT Subproblem: A Necessary and Sufficient Condition
- Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints
- Strong duality in robust convex programming: complete characterizations
- The generalized trust region subproblem
- The trust region subproblem with non-intersecting linear constraints
- The University of Florida sparse matrix collection
- Theory and applications of robust optimization
- Trust Region Methods
- Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization
- Weak sharp minima revisited. II: Application to linear regularity and error bounds
Cited in
(8)- Refined bounds on the convergence of block Lanczos method for extended trust-region subproblem
- A Nested Lanczos Method for the Trust-Region Subproblem
- Solving the Trust-Region Subproblem using the Lanczos Method
- A block Lanczos method for the CDT subproblem
- Alternating direction method of multipliers for the extended trust region subproblem
- On the generalized Lanczos trust-region method
- A Block Lanczos Method for Large-Scale Quadratic Minimization Problems with Orthogonality Constraints
- A block Lanczos method for the symmetric generalized eigenvalue complementarity problem
This page was built for publication: A block Lanczos method for the extended trust-region subproblem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4629333)
