An Interior Point Cutting Plane Method for the Convex Feasibility Problem with Second-Order Cone Inequalities

DOI10.1287/moor.1040.0116zbMath1082.90138OpenAlexW2037284017MaRDI QIDQ5704215

Mohammad R. Oskoorouchi, Jean-Louis Goffin

Publication date: 11 November 2005

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/564035dcd09c254a8bba4a1d6c430dfd7ef76ff3

zbMATH Keywords

nondifferentiable optimizationanalytic centersecond-order conecutting plane algorithm

Mathematics Subject Classification ID

Convex programming (90C25) Interior-point methods (90C51)

Related Items (7)

A second-order cone cutting surface method: Complexity and application ⋮ A matrix generation approach for eigenvalue optimization ⋮ An extension of Chubanov's algorithm to symmetric cones ⋮ Approximation algorithms from inexact solutions to semidefinite programming relaxations of combinatorial optimization problems ⋮ Selective Gram-Schmidt orthonormalization for conic cutting surface algorithms ⋮ Using selective orthonormalization to update the analytic center after addition of multiple cuts ⋮ Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts

This page was built for publication: An Interior Point Cutting Plane Method for the Convex Feasibility Problem with Second-Order Cone Inequalities