A finite steps algorithm for solving convex feasibility problems

DOI10.1007/S10898-006-9088-YMaRDI QIDQ2460116zbMATH OpenOpenAlexFDO

Authors Mustapha Ait Rami, Uwe Helmke, John Moore

Publication date 14 November 2007

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

Full work available at URL https://doi.org/10.1007/s10898-006-9088-y

zbMATH Keywords

alternating projectionseigenvalue problemlinear matrix inequality

Mathematics Subject Classification ID

Convex programming (90C25)

Recommendations

• A log-quadratic projection method for convex feasibility problems
• Projection algorithms for convex feasibility problem
• An algorithm for the convex feasibility problem
• On Projection Algorithms for Solving Convex Feasibility Problems
• Publication:3028739

Cites work

• scientific article; zbMATH DE number 729680 (Why is no real title available?)
• scientific article; zbMATH DE number 3229228 (Why is no real title available?)
• scientific article; zbMATH DE number 3281211 (Why is no real title available?)
• A new polynomial-time algorithm for linear programming
• A successive projection method
• An exact duality theory for semidefinite programming and its complexity implications
• Cones, matrices and mathematical programming
• Functional Operators (AM-21), Volume 1
• Linear Matrix Inequalities in System and Control Theory
• On Projection Algorithms for Solving Convex Feasibility Problems
• Semidefinite Programming
• The method of projections for finding the common point of convex sets
• The projective method for solving linear matrix inequalities
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones

Cited in

(14)

• scientific article; zbMATH DE number 6263278 (Why is no real title available?)
• An alternating projection algorithm for finding feasible points of block-diagonal semidefinite constraints
• Gradient-type methods: a unified perspective in computer science and numerical analysis
• Generalized projections onto convex sets
• A log-quadratic projection method for convex feasibility problems
• Reflection-projection method for convex feasibility problems with an obtuse cone
• Formalization of Incremental Simplex Algorithm by Stepwise Refinement
• Insurance pricing using \(H_{\infty}\)-control
• Improving an alternating projection algorithm for semidefinite programming feasibility problem and an implementation for second-order cones
• Single-projection procedure for linear optimization
• On the finite termination of the Douglas-Rachford method for the convex feasibility problem
• Constraint consensus methods for finding strictly feasible points of linear matrix inequalities
• Accelerated reflection projection algorithm and its application to the LMI problem
• An alternating projections algorithm for solving linear programs

Describes a project that uses

Uses Software

• SeDuMi

This page was built for publication: A finite steps algorithm for solving convex feasibility problems

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