Conditional quadratic semidefinite programming: examples and methods
From MaRDI portal
Publication:489109
DOI10.1007/S40305-014-0048-9zbMATH Open1338.90296OpenAlexW2041814638MaRDI QIDQ489109FDOQ489109
Authors: Houduo Qi 
Publication date: 27 January 2015
Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40305-014-0048-9
Recommendations
- scientific article; zbMATH DE number 5239114
- Quadratic Matrix Programming
- A Newton-CG Augmented Lagrangian Method for Convex Quadratically Constrained Quadratic Semidefinite Programs
- An inexact primal-dual path following algorithm for convex quadratic SDP
- Semidefinite programming for discrete optimization and matrix completion problems
Cites Work
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- Numerical Optimization
- Modern multidimensional scaling. Theory and applications.
- A Newton-CG augmented Lagrangian method for semidefinite programming
- Multidimensional scaling. I: Theory and method
- A Quadratically Convergent Newton Method for Computing the Nearest Correlation Matrix
- Methods of conjugate gradients for solving linear systems
- Multidimensional scaling.
- A nonsmooth version of Newton's method
- Optimization and nonsmooth analysis
- Title not available (Why is that?)
- An inexact accelerated proximal gradient method for large scale linearly constrained convex SDP
- An Alternating Projection Algorithm for Computing the Nearest Euclidean Distance Matrix
- Interpolation of scattered data: distance matrices and conditionally positive definite functions
- Equality relating Euclidean distance cone to positive semidefinite cone
- Calibrating Least Squares Semidefinite Programming with Equality and Inequality Constraints
- An inexact primal-dual path following algorithm for convex quadratic SDP
- A cyclic projection algorithm via duality
- An augmented Lagrangian dual approach for the H-weighted nearest correlation matrix problem
- Analysis of Nonsmooth Symmetric-Matrix-Valued Functions with Applications to Semidefinite Complementarity Problems
- Semismooth Matrix-Valued Functions
- Approximation by matrices positive semidefinite on a subspace
- Solving Euclidean distance matrix completion problems via semidefinite progrmming
- Constraint Nondegeneracy, Strong Regularity, and Nonsingularity in Semidefinite Programming
- Distance matrix completion by numerical optimization
- Definiteness and semidefiniteness of quadratic forms revisited
- Conditionally definite matrices
- A TWO-REGIME, STOCHASTIC-VOLATILITY EXTENSION OF THE LIBOR MARKET MODEL
- The best Euclidean fit to a given distance matrix in prescribed dimensions
- The embedding problem for predistance matrices
- Hadamard inverses, square roots and products of almost semidefinite matrices
- The positive definite completion problem relative to a subspace
- Molecular embedding via a second order dissimilarity parameterized approach
- Title not available (Why is that?)
- Constrained best Euclidean distance embedding on a sphere: a matrix optimization approach
- A semismooth Newton method for the nearest Euclidean distance matrix problem
- A convex quadratic semi-definite programming approach to the partial additive constant problem in multidimensional scaling
- Conditionally positive functions and p-norm distance matrices
Cited In (7)
- An Ordinal Weighted EDM Model for Nonmetric Multidimensional Scaling
- Parameter-related projection-based iterative algorithm for a kind of generalized positive semidefinite least squares problem
- Perturbation analysis of the Euclidean distance matrix optimization problem and its numerical implications
- A convex matrix optimization for the additive constant problem in multidimensional scaling with application to locally linear embedding
- Robust least square semidefinite programming with applications
- Feasibility and a fast algorithm for Euclidean distance matrix optimization with ordinal constraints
- Half thresholding eigenvalue algorithm for semidefinite matrix completion
This page was built for publication: Conditional quadratic semidefinite programming: examples and methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q489109)
