On a box-constrained linear symmetric cone optimization problem
From MaRDI portal
Publication:2420823
DOI10.1007/s10957-019-01493-zzbMath1447.65010WikidataQ128326485 ScholiaQ128326485MaRDI QIDQ2420823
Publication date: 7 June 2019
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-019-01493-z
spectral decomposition; second-order cone; box-constrained linear symmetric cone optimization problem
65K05: Numerical mathematical programming methods
65K10: Numerical optimization and variational techniques
15B48: Positive matrices and their generalizations; cones of matrices
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving semidefinite-quadratic-linear programs using SDPT3
- A feasible direction method for the semidefinite program with box constraints
- An inexact primal-dual path following algorithm for convex quadratic SDP
- A new trust region algorithm for bound constrained minimization
- Extension of primal-dual interior point algorithms to symmetric cones
- Second-order cone programming
- Similarity and other spectral relations for symmetric cones
- Large-scale active-set box-constrained optimization method with spectral projected gradients
- Recent Advances in Bound Constrained Optimization
- A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
- An Augmented Primal-Dual Method for Linear Conic Programs
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- An Active Set Newton Algorithm for Large-Scale Nonlinear Programs with Box Constraints
- An Interior-Point Method for Semidefinite Programming
- Regularization Methods for Semidefinite Programming
- A new approach to variable metric algorithms
- The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations
- Handbook of semidefinite programming. Theory, algorithms, and applications
