A prediction-correction inexact alternating direction method for convex nonlinear second-order cone programming with linear constraints
DOI10.1186/s13660-020-2285-2zbMath1503.90138OpenAlexW3030201206MaRDI QIDQ2069275
Publication date: 20 January 2022
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13660-020-2285-2
inexact alternating direction methodconvex nonlinear second-order cone programmingseparate structure convex programmingthree-fingered grasping force optimization
Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Convex programming (90C25) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A modified alternating direction method for convex quadratically constrained quadratic semidefinite programs
- 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
- Convergence of the augmented Lagrangian method for nonlinear optimization problems over second-order cones
- Applications of convex optimization in signal processing and digital communication
- Second-order cone programming
- A new inexact alternating directions method for monotone variational inequalities
- A homotopy method for nonlinear second-order cone programming
- An SQP-type algorithm for nonlinear second-order cone programs
- An unconstrained smooth minimization reformulation of the second-order cone complementarity problem
- Smoothing Functions for Second-Order-Cone Complementarity Problems
- An alternating direction method for solving convex nonlinear semidefinite programming problems
- A primal–dual interior point method for nonlinear optimization over second-order cones
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- S<i>l</i><sub>1</sub>QP Based Algorithm with Trust Region Technique for Solving Nonlinear Second-Order Cone Programming Problems
- On the Local Convergence of Semismooth Newton Methods for Linear and Nonlinear Second-Order Cone Programs Without Strict Complementarity
- Optimal design of IIR digital filters with robust stability using conic-quadraticprogramming updates
This page was built for publication: A prediction-correction inexact alternating direction method for convex nonlinear second-order cone programming with linear constraints