A feasible filter method for the nearest low-rank correlation matrix problem (Q494667): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5433140 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projection-like Retractions on Matrix Manifolds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Point Step Size Gradient Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A preconditioned Newton algorithm for the nearest correlation matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Least-Squares Covariance Matrix Adjustment / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local minima and convergence in low-rank semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the nonmonotone line search / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Geometry of Algorithms with Orthogonality Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear programming without a penalty function. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Curvilinear Search Method for <i>p</i>-Harmonic Flows on Spheres / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Multidimensional Filter Algorithm for Nonlinear Equations and Nonlinear Least-Squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Filter-Trust-Region Method for Unconstrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Nonmonotone Line Search Technique for Newton’s Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient rank reduction of correlation matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the nearest correlation matrix--a problem from finance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Functions of Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Sequential Semismooth Newton Method for the Nearest Low-rank Correlation Matrix Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dual Approach to Semidefinite Least-Squares Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nineteen Dubious Ways to Compute the Exponential of a Matrix, Twenty-Five Years Later / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5491447 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank reduction of correlation matrices by majorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Quadratically Convergent Newton Method for Computing the Nearest Correlation Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal low-rank approximation to a correlation matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A feasible method for optimization with orthogonality constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Newton-CG Augmented Lagrangian Method for Semidefinite Programming / rank
 
Normal rank

Latest revision as of 16:44, 10 July 2024

scientific article
Language Label Description Also known as
English
A feasible filter method for the nearest low-rank correlation matrix problem
scientific article

    Statements

    A feasible filter method for the nearest low-rank correlation matrix problem (English)
    0 references
    0 references
    1 September 2015
    0 references
    The paper presents a new easily computed constrained-preserving update scheme which can be viewed as a generalization of the Cayley transform, a classical retraction on the Stiefel manifold. A simple filter mechanism for unconstrained optimization is used in the given feasible method to promote global convergence to first-order critical points. Numerical results are given.
    0 references
    0 references
    low-rank correlation matrix
    0 references
    feasible method
    0 references
    Stiefel manifold
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references