Linear Programming on the Stiefel Manifold
From MaRDI portal
Publication:6202765
DOI10.1137/23m1552243arXiv2301.06918MaRDI QIDQ6202765
Publication date: 27 February 2024
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2301.06918
linear programmingsemidefinite programmingoptimality conditionsStiefel manifoldquadratically constrained quadratic optimization
Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Optimality conditions and duality in mathematical programming (90C46)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An optimal variant of Kelley's cutting-plane method
- Rank-reducibility of a symmetric matrix and sampling theory of minimum trace factor analysis
- On some applications of Hadamard matrices
- Linear and nonlinear programming.
- On the convexity of a class of quadratic mappings and its application to the problem of finding the smallest ball enclosing a given intersection of balls
- Convexity properties associated with nonconvex quadratic matrix functions and applications to quadratic programming
- A remark on the convexity and positive definiteness concerning Hermitian matrices
- Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
- Problems of distance geometry and convex properties of quadratic maps
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- A note on lack of strong duality for quadratic problems with orthogonal constraints
- On minimization on Stiefel manifolds
- Simple algorithms for optimization on Riemannian manifolds with constraints
- A survey of hidden convex optimization
- Partial Lagrangian relaxation for the unbalanced orthogonal Procrustes problem
- A generalized solution of the orthogonal Procrustes problem
- Richtungsfelder und Fernparallelismus in \(n\)-dimensionalen Mannigfaltigkeiten
- The orthogonal approximation of an oblique structure in factor analysis
- On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues
- A Nonlinear Programming Technique for the Optimization of Continuous Processing Systems
- On Equivalence of Semidefinite Relaxations for Quadratic Matrix Programming
- On the Ball-Constrained Weighted Maximin Dispersion Problem
- The Cutting-Plane Method for Solving Convex Programs
- Local Minimizers of Quadratic Functions on Euclidean Balls and Spheres
- Cauchy's Interlace Theorem for Eigenvalues of Hermitian Matrices
- Rank Optimality for the Burer--Monteiro Factorization
- Deterministic Guarantees for Burer‐Monteiro Factorizations of Smooth Semidefinite Programs
- Closing the Gap between Necessary and Sufficient Conditions for Local Nonglobal Minimizer of Trust Region Subproblem
- Proximal Gradient Method for Nonsmooth Optimization over the Stiefel Manifold
- Optimization algorithms exploiting unitary constraints
- Quadratic Matrix Programming
- On Local Minimizers of Nonconvex Homogeneous Quadratically Constrained Quadratic Optimization with at Most Two Constraints
- Hadamard matrices and their applications
- Riemannian optimization via Frank-Wolfe methods
This page was built for publication: Linear Programming on the Stiefel Manifold
