A cone constrained convex program: structure and algorithms
From MaRDI portal
Publication:384210
DOI10.1007/s40305-013-0005-zzbMath1277.90094OpenAlexW2038655893MaRDI QIDQ384210
Ya-Xiang Yuan, Xinzhen Zhang, Liqun Qi, Yi Xu
Publication date: 27 November 2013
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-013-0005-z
Related Items (4)
A tensor analogy of Yuan's theorem of the alternative and polynomial optimization with sign structure ⋮ Cross-Hill: a heuristic method for global optimization ⋮ Space tensor conic programming ⋮ A linear mixed integer programming model for \(N\)-vehicle exploration problem
Cites Work
- Unnamed Item
- Unnamed Item
- Nonnegative diffusion orientation distribution function
- Space tensor conic programming
- Z-eigenvalue methods for a global polynomial optimization problem
- Characterization of the barrier parameter of homogeneous convex cones
- Hyperbolic programs, and their derivative relaxations
- Eigenvalues of a real supersymmetric tensor
- Optimization theory and methods. Nonlinear programming
- Projected gradient methods for linearly constrained problems
- On constrained optimization by adjoint based quasi-Newton methods
- Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems
- Higher Order Positive Semidefinite Diffusion Tensor Imaging
This page was built for publication: A cone constrained convex program: structure and algorithms
