Limited memory BFGS algorithm for the matrix approximation problem in Frobenius norm
From MaRDI portal
Publication:2176186
DOI10.1007/S40314-020-1089-9zbMATH Open1449.65123OpenAlexW3004802997MaRDI QIDQ2176186FDOQ2176186
Authors: Chungen Shen, Changxing Fan, Yunlong Wang, Wenjuan Xue 
Publication date: 4 May 2020
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40314-020-1089-9
Recommendations
- A numerical study of limited memory BFGS methods
- A limited memory BFGS algorithm for non-convex minimization with applications in matrix largest eigenvalue problem
- scientific article; zbMATH DE number 1780188
- On the limited memory BFGS method for large scale optimization
- A limited memory BFGS subspace algorithm for bound constrained nonsmooth problems
- scientific article; zbMATH DE number 7353599
- Limited memory BFGS method for least squares semidefinite programming with banded structure
- Improved Hessian approximations for the limited memory BFGS method
- A limited memory BFGS-type method for large-scale unconstrained optimization
- A modified limited memory BFGS method for large-scale optimization
Numerical mathematical programming methods (65K05) Methods of successive quadratic programming type (90C55) Nonlinear programming (90C30)
Cites Work
- Newton's Method for Large Bound-Constrained Optimization Problems
- Computing the nearest correlation matrix--a problem from finance
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A Limited Memory Algorithm for Bound Constrained Optimization
- Title not available (Why is that?)
- On the limited memory BFGS method for large scale optimization
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Quadratically Convergent Newton Method for Computing the Nearest Correlation Matrix
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- A preconditioned Newton algorithm for the nearest correlation matrix
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A limited memory quasi-Newton trust-region method for box constrained optimization
- Two-Metric Projection Methods for Constrained Optimization
- An Algorithm for Restricted Least Squares Regression
- A New Active Set Algorithm for Box Constrained Optimization
- A Dual Approach to Semidefinite Least-Squares Problems
- An active set limited memory BFGS algorithm for bound constrained optimization
- A subspace limited memory quasi-Newton algorithm for large-scale nonlinear bound constrained optimization
- Solving large-scale least squares semidefinite programming by alternating direction methods
- A new subspace limited memory BFGS algorithm for large-scale bound constrained optimization
- An active set limited memory BFGS algorithm for large-scale bound constrained optimization
- Calibrating Least Squares Semidefinite Programming with Equality and Inequality Constraints
- Convergence analysis of a modified BFGS method on convex minimizations
- Correlation stress testing for value-at-risk: an unconstrained convex optimization approach
- A descent method for structured monotone variational inequalities
- Least-Squares Covariance Matrix Adjustment
- A projected semismooth Newton method for problems of calibrating least squares covariance matrix
- A two-stage active-set algorithm for bound-constrained optimization
- Decomposition methods for sparse matrix nearness problems
- Limited memory BFGS method for least squares semidefinite programming with banded structure
Cited In (9)
- An accelerated active-set algorithm for a quadratic semidefinite program with general constraints
- Alternating direction method for a class of constrained matrix approximation problems
- An efficient algorithm for solving a class of matrix optimization problem in scalable probabilistic approximation
- Title not available (Why is that?)
- A dual active-set proximal Newton algorithm for sparse approximation of correlation matrices
- Limited memory BFGS method based on a high-order tensor model
- Limited memory BFGS method for least squares semidefinite programming with banded structure
- Diagonally scaled memoryless quasi-Newton methods with application to compressed sensing
- Nonmonotone diagonally scaled limited-memory BFGS methods with application to compressive sensing based on a penalty model
Uses Software
This page was built for publication: Limited memory BFGS algorithm for the matrix approximation problem in Frobenius norm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2176186)
