Constraint consensus methods for finding strictly feasible points of linear matrix inequalities

DOI10.1155/2015/790451OpenAlexW2045976552WikidataQ59114178 ScholiaQ59114178MaRDI QIDQ1659091

Shafiu Jibrin, James W. Swift

Publication date: 15 August 2018

Published in: Journal of Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2015/790451

zbMATH Keywords

crossing pointconstraint consensus method

Mathematics Subject Classification ID

Linear programming (90C05)

Uses Software

• SDPLIB
• SeDuMi

Cites Work

• Unnamed Item
• Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices
• The projective method for solving linear matrix inequalities
• Improving solver success in reaching feasibility for sets of nonlinear constraints
• A finite steps algorithm for solving convex feasibility problems
• The Constraint Consensus Method for Finding Approximately Feasible Points in Nonlinear Programs
• Feasibility and Constraint Analysis of Sets of Linear Matrix Inequalities
• Semidefinite optimization
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• SDPLIB 1.2, a library of semidefinite programming test problems
• Semidefinite Programming

This page was built for publication: Constraint consensus methods for finding strictly feasible points of linear matrix inequalities