A finite steps algorithm for solving convex feasibility problems

DOI10.1007/S10898-006-9088-YzbMATH Open1180.90239OpenAlexW2127777213MaRDI QIDQ2460116FDOQ2460116

Uwe Helmke, John Moore, Mustapha Ait Rami

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

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

zbMATH Keywords

alternating projectionseigenvalue problemlinear matrix inequality

Mathematics Subject Classification ID

Convex programming (90C25)

Cites Work

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

Cited In (11)

• Title not available (Why is that?)
• 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
• Formalization of Incremental Simplex Algorithm by Stepwise Refinement
• Reflection-projection method for convex feasibility problems with an obtuse cone
• Insurance pricing using \(H_{\infty}\)-control
• On the finite termination of the Douglas-Rachford method for the convex feasibility problem
• Single-projection procedure for linear optimization
• Constraint consensus methods for finding strictly feasible points of linear matrix inequalities
• Accelerated reflection projection algorithm and its application to the LMI problem

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)