A Barzilai and Borwein regularization feasible direction algorithm for convex nonlinear SOC programming with linear constraints

DOI10.1016/j.cam.2021.113781zbMath1478.90093OpenAlexW3198719375MaRDI QIDQ2231300

Yanyan Li

Publication date: 29 September 2021

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2021.113781

zbMATH Keywords

alternating direction methodconvex nonlinear second-order cone programmingBarzilai and Borwein parametersregularization feasible direction method

Mathematics Subject Classification ID

Convex programming (90C25)

Uses Software

• SeDuMi

Cites Work

• An alternating direction method for second-order conic 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
• A regularization of the Frank-Wolfe method and unification of certain nonlinear programming methods
• Applications of convex optimization in signal processing and digital communication
• Second-order cone programming
• An alternating direction method for convex quadratic second-order cone programming with bounded constraints
• Parallel multi-block ADMM with \(o(1/k)\) convergence
• Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
• A homotopy method for nonlinear second-order cone programming
• An SQP-type algorithm for nonlinear second-order cone programs
• Interior proximal algorithm with variable metric for second-order cone programming: applications to structural optimization and support vector machines
• On Full Jacobian Decomposition of the Augmented Lagrangian Method for Separable Convex Programming
• Solving Multiple-Block Separable Convex Minimization Problems Using Two-Block Alternating Direction Method of Multipliers
• A primal–dual interior point method for nonlinear optimization over second-order cones
• Two-Point Step Size Gradient Methods
• An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• S<i>l</i>₁QP Based Algorithm with Trust Region Technique for Solving Nonlinear Second-Order Cone Programming Problems
• A feasible direction algorithm for nonlinear second-order cone programs
• Optimal design of IIR digital filters with robust stability using conic-quadraticprogramming updates
• Convergence Rate Analysis for the Alternating Direction Method of Multipliers with a Substitution Procedure for Separable Convex Programming
• The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Barzilai and Borwein regularization feasible direction algorithm for convex nonlinear SOC programming with linear constraints