Constraint consensus methods for finding interior feasible points in second-order cones

DOI10.1155/2010/307209zbMath1208.90188OpenAlexW2133189332WikidataQ58652403 ScholiaQ58652403MaRDI QIDQ624763

Shafiu Jibrin, Kaitlyn Tuthill, Anna E. Weigandt

Publication date: 9 February 2011

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

Full work available at URL: https://eudml.org/doc/228994

zbMATH Keywords

backtracking-like line searchnear-feasible point

Mathematics Subject Classification ID

Nonlinear programming (90C30) Interior-point methods (90C51)

Uses Software

• LPbook

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Applications of second-order cone programming
• Second-order cone programming
• Improving solver success in reaching feasibility for sets of nonlinear constraints
• The Constraint Consensus Method for Finding Approximately Feasible Points in Nonlinear Programs
• Feasibility and Constraint Analysis of Sets of Linear Matrix Inequalities
• Inherently parallel algorithms in feasibility and optimization and their applications. Research workshop, Haifa, Israel, March 13--16, 2000
• Linear programming. Foundations and extensions

This page was built for publication: Constraint consensus methods for finding interior feasible points in second-order cones