On the Second-Order Feasibility Cone: Primal-Dual Representation and Efficient Projection

DOI10.1137/06067198XzbMATH Open1194.90123OpenAlexW2078669260MaRDI QIDQ3395005FDOQ3395005

Authors: A. Belloni, Robert M. Freund 

Publication date: 20 August 2009

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/06067198x

Recommendations

• Solving conic systems via projection and rescaling
• Projection methods for conic feasibility problems: applications to polynomial sum-of-squares decompositions
• A fast projection and contraction method for second-order conic programming
• An Interior Point Cutting Plane Method for the Convex Feasibility Problem with Second-Order Cone Inequalities
• How to project onto extended second order cones

zbMATH Keywords

computational complexityprojectionconvex coneNewton methodsecond-order cone

Mathematics Subject Classification ID

Convex programming (90C25) Interior-point methods (90C51) Abstract computational complexity for mathematical programming problems (90C60) Newton-type methods (49M15) Numerical methods involving duality (49M29)

Cited In (4)

• Convergence rate analysis of the multiplicative gradient method for PET-type problems
• The \(\mathcal{S}\)-cone and a primal-dual view on second-order representability
• Title not available (Why is that?)
• Relatively Smooth Convex Optimization by First-Order Methods, and Applications

This page was built for publication: On the Second-Order Feasibility Cone: Primal-Dual Representation and Efficient Projection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3395005)