An alternating direction method for convex quadratic second-order cone programming with bounded constraints
From MaRDI portal
Publication:1665536
DOI10.1155/2015/379734zbMath1394.90453OpenAlexW1988913454WikidataQ59118236 ScholiaQ59118236MaRDI QIDQ1665536
Publication date: 27 August 2018
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2015/379734
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Solving semidefinite-quadratic-linear programs using SDPT3
- A modified alternating direction method for convex quadratically constrained quadratic semidefinite programs
- Alternating direction augmented Lagrangian methods for semidefinite programming
- A trust region SQP-filter method for nonlinear second-order cone programming
- Clarke generalized Jacobian of the projection onto symmetric cones
- On the coderivative of the projection operator onto the second-order cone
- Extension of primal-dual interior point algorithms to symmetric cones
- Polynomial convergence of primal-dual algorithms for the second-order cone program based on the MZ-family of directions
- An SQP-type algorithm for nonlinear second-order cone programs
- Solving semidefinite programming problems via alternating direction methods
- Associative and Jordan Algebras, and Polynomial Time Interior-Point Algorithms for Symmetric Cones
- A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
- An Efficient TVL1 Algorithm for Deblurring Multichannel Images Corrupted by Impulsive Noise
- Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Regularization Methods for Semidefinite Programming
This page was built for publication: An alternating direction method for convex quadratic second-order cone programming with bounded constraints
