An alternating direction method for second-order conic programming

DOI10.1016/J.COR.2013.01.010zbMath1348.90518OpenAlexW2078701381MaRDI QIDQ336362

Yaling Zhang, Xuewen Mu

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2013.01.010

zbMATH Keywords

alternating direction methodsecond-order cone programmingdual augmented Lagrangian methodprimal-dual interior point method

Mathematics Subject Classification ID

Semidefinite programming (90C22) Sensitivity, stability, parametric optimization (90C31)

Related Items (2)

A Barzilai and Borwein regularization feasible direction algorithm for convex nonlinear SOC programming with linear constraints ⋮ A class of multilevel structured low-rank approximation arising in material processing

Uses Software

• SeDuMi
• RecPF
• FTVd

Cites Work

• Unnamed Item
• Unnamed Item
• A modified alternating direction method for convex quadratically constrained quadratic semidefinite programs
• Alternating direction augmented Lagrangian methods for semidefinite programming
• Clarke generalized Jacobian of the projection onto symmetric cones
• On the coderivative of the projection operator onto the second-order cone
• Applications of second-order cone programming
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
• A dual algorithm for the solution of nonlinear variational problems via finite element approximation
• A variable-penalty alternating directions method for convex optimization
• A proximal-based deomposition method for compositions method for convex minimization problems
• Applications of convex optimization in signal processing and digital communication
• Second-order cone programming
• Polynomial convergence of primal-dual algorithms for the second-order cone program based on the MZ-family of directions
• Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
• A new inexact alternating directions method for monotone variational inequalities
• Complementarity functions and numerical experiments on some smoothing Newton methods for second-order-cone complementarity problems
• Interior point methods for second-order cone programming and OR applications
• Solving semidefinite programming problems via alternating direction methods
• An unconstrained smooth minimization reformulation of the second-order cone complementarity problem
• Smoothing Functions for Second-Order-Cone Complementarity Problems
• A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
• An Efficient TVL1 Algorithm for Deblurring Multichannel Images Corrupted by Impulsive Noise
• An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
• Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• Proximal Decomposition Via Alternating Linearization
• On the Local Convergence of Semismooth Newton Methods for Linear and Nonlinear Second-Order Cone Programs Without Strict Complementarity
• Regularization Methods for Semidefinite Programming
• Optimal design of IIR digital filters with robust stability using conic-quadraticprogramming updates
• Solving Second Order Cone Programming via a Reduced Augmented System Approach
• A descent method for structured monotone variational inequalities

This page was built for publication: An alternating direction method for second-order conic programming