Limited memory BFGS algorithm for the matrix approximation problem in Frobenius norm
From MaRDI portal
Publication:2176186
DOI10.1007/s40314-020-1089-9zbMath1449.65123OpenAlexW3004802997MaRDI QIDQ2176186
Yunlong Wang, Wenjuan Xue, Chungen Shen, Changxing Fan
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
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of successive quadratic programming type (90C55)
Related Items
A dual active-set proximal Newton algorithm for sparse approximation of correlation matrices, Nonmonotone diagonally scaled limited-memory BFGS methods with application to compressive sensing based on a penalty model, Limited memory BFGS method for least squares semidefinite programming with banded structure, An accelerated active-set algorithm for a quadratic semidefinite program with general constraints, Diagonally scaled memoryless quasi-Newton methods with application to compressed sensing
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing the nearest correlation matrix--a problem from finance
- A limited memory quasi-Newton trust-region method for box constrained optimization
- An active set limited memory BFGS algorithm for bound constrained optimization
- Convergence analysis of a modified BFGS method on convex minimizations
- A new subspace limited memory BFGS algorithm for large-scale bound constrained optimization
- On the limited memory BFGS method for large scale optimization
- An active set limited memory BFGS algorithm for large-scale bound constrained optimization
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A projected semismooth Newton method for problems of calibrating least squares covariance matrix
- A two-stage active-set algorithm for bound-constrained optimization
- Correlation stress testing for value-at-risk: an unconstrained convex optimization approach
- Limited memory BFGS method for least squares semidefinite programming with banded structure
- Two-Metric Projection Methods for Constrained Optimization
- An Algorithm for Restricted Least Squares Regression
- A Quadratically Convergent Newton Method for Computing the Nearest Correlation Matrix
- A New Active Set Algorithm for Box Constrained Optimization
- Decomposition Methods for Sparse Matrix Nearness Problems
- Calibrating Least Squares Semidefinite Programming with Equality and Inequality Constraints
- A subspace limited memory quasi-Newton algorithm for large-scale nonlinear bound constrained optimization
- A Dual Approach to Semidefinite Least-Squares Problems
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- Newton's Method for Large Bound-Constrained Optimization Problems
- A Limited Memory Algorithm for Bound Constrained Optimization
- A preconditioned Newton algorithm for the nearest correlation matrix
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- Least-Squares Covariance Matrix Adjustment
- A descent method for structured monotone variational inequalities
- Navigating in a Graph by Aid of Its Spanning Tree Metric
