On a box-constrained linear symmetric cone optimization problem

DOI10.1007/S10957-019-01493-ZMaRDI QIDQ2420823zbMATH OpenOpenAlexWikidataFDO

Authors Yi Xu, Xihong Yan

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

zbMATH Keywords

second-order conespectral decompositionbox-constrained linear symmetric cone optimization problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Numerical optimization and variational techniques (65K10) Positive matrices and their generalizations; cones of matrices (15B48)

Recommendations

• On box constrained concave quadratic optimization
• scientific article; zbMATH DE number 2124285
• Solutions and optimality criteria to box constrained nonconvex minimization problems
• On convex optimization with linear constraints
• An algorithm for solving convex programs subject to box constraints
• A convergent decomposition method for box-constrained optimization problems
• On nonconvex quadratic programming with box constraints
• scientific article; zbMATH DE number 4135708
• Linear optimization with box constraints in Banach spaces
• A boxed optimization reformulation for the convex second order cone programming

Cites work

• scientific article; zbMATH DE number 1215255 (Why is no real title available?)
• scientific article; zbMATH DE number 715155 (Why is no real title available?)
• scientific article; zbMATH DE number 1131479 (Why is no real title available?)
• A Newton-CG augmented Lagrangian method for semidefinite programming
• A feasible direction method for the semidefinite program with box constraints
• A new approach to variable metric algorithms
• A new trust region algorithm for bound constrained minimization
• An Active Set Newton Algorithm for Large-Scale Nonlinear Programs with Box Constraints
• An Augmented Primal-Dual Method for Linear Conic Programs
• An Interior-Point Method for Semidefinite Programming
• An inexact primal-dual path following algorithm for convex quadratic SDP
• Extension of primal-dual interior point algorithms to symmetric cones
• Handbook of semidefinite programming. Theory, algorithms, and applications
• Large-scale active-set box-constrained optimization method with spectral projected gradients
• Recent advances in bound constrained optimization
• Regularization methods for semidefinite programming
• Second-order cone programming
• Self-Scaled Barriers and Interior-Point Methods for Convex Programming
• Similarity and other spectral relations for symmetric cones
• Solving semidefinite-quadratic-linear programs using SDPT3
• The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations

Cited in

(3)

• On box-constrained total least squares problem
• An upper bound on the minimum rank of a symmetric Toeplitz matrix completion problem
• Quadratic program on a structured nonconvex set

Describes a project that uses

Uses Software

• QSDP
• YALMIP
• SDPT3

This page was built for publication: On a box-constrained linear symmetric cone optimization problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2420823)