An alternating direction method for second-order conic programming
From MaRDI portal
Publication:336362
DOI10.1016/J.COR.2013.01.010zbMATH Open1348.90518OpenAlexW2078701381MaRDI QIDQ336362FDOQ336362
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
alternating direction methodsecond-order cone programmingdual augmented Lagrangian methodprimal-dual interior point method
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Regularization Methods for Semidefinite Programming
- A proximal-based deomposition method for compositions method for convex minimization problems
- On the coderivative of the projection operator onto the second-order cone
- Applications of second-order cone programming
- Second-order cone programming
- A new inexact alternating directions method for monotone variational inequalities
- An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
- Alternating direction augmented Lagrangian methods for semidefinite programming
- Complementarity functions and numerical experiments on some smoothing Newton methods for second-order-cone complementarity problems
- An unconstrained smooth minimization reformulation of the second-order cone complementarity problem
- Smoothing functions for second-order-cone complementarity problems
- Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities
- Polynomial convergence of primal-dual algorithms for the second-order cone program based on the MZ-family of directions
- A variable-penalty alternating directions method for convex optimization
- An Efficient TVL1 Algorithm for Deblurring Multichannel Images Corrupted by Impulsive Noise
- Solving semidefinite programming problems via alternating direction methods
- On the Local Convergence of Semismooth Newton Methods for Linear and Nonlinear Second-Order Cone Programs Without Strict Complementarity
- Applications of convex optimization in signal processing and digital communication
- Interior point methods for second-order cone programming and OR applications
- Proximal Decomposition Via Alternating Linearization
- 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
- A modified alternating direction method for convex quadratically constrained quadratic semidefinite programs
- Clarke generalized Jacobian of the projection onto symmetric cones
Cited In (5)
- A Barzilai and Borwein regularization feasible direction algorithm for convex nonlinear SOC programming with linear constraints
- An efficient algorithm for second-order cone linear complementarity problems
- A class of multilevel structured low-rank approximation arising in material processing
- Second-order negative-curvature methods for box-constrained and general constrained optimization
- A feasible direction algorithm for nonlinear second-order cone programs
Uses Software
This page was built for publication: An alternating direction method for second-order conic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336362)
