The following pages link to A successive projection method (Q1262213):
Displaying 50 items.
- Fundamentals of cone regression (Q289730) (← links)
- Projection on the intersection of convex sets (Q314761) (← links)
- Computing the nearest Euclidean distance matrix with low embedding dimensions (Q463737) (← links)
- Alternating projection method for sparse model updating problems (Q525263) (← links)
- An active index algorithm for the nearest point problem in a polyhedral cone (Q548684) (← links)
- Contraction and uniform convergence of isotonic regression (Q668612) (← links)
- Optimal \(H_ \infty\) model reduction via linear matrix inequalities: continuous- and discrete-time cases (Q672224) (← links)
- The nearest point problem in a polyhedral set and its extensions (Q694540) (← links)
- On the unrestricted iteration of projections in Hilbert space (Q808180) (← links)
- Computation of efficient compromise arcs in convex quadratic multicriteria optimization (Q813340) (← links)
- Efficient rank reduction of correlation matrices (Q875015) (← links)
- Solving Hankel matrix approximation problem using semidefinite programming (Q875374) (← links)
- Dykstra's algorithm for constrained least-squares doubly symmetric matrix problems (Q982653) (← links)
- A cyclic projection algorithm via duality (Q1123132) (← links)
- The embedding problem for predistance matrices (Q1176717) (← links)
- Optimality tests for partitioning and sectional search algorithms (Q1178318) (← links)
- On the convergence of Han's method for convex programming with quadratic objective (Q1181736) (← links)
- Asymptotic properties of the Fenchel dual functional and applications to decomposition problems (Q1321191) (← links)
- A row-action method for convex programming (Q1330898) (← links)
- A multiprojection algorithm using Bregman projections in a product space (Q1344108) (← links)
- Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces. (Q1421503) (← links)
- A non-interior continuation algorithm for solving the convex feasibility problem (Q1634140) (← links)
- Structured low rank approximation (Q1874666) (← links)
- Primal-dual row-action method for convex programming (Q1904955) (← links)
- Low-order control design for LMI problems using alternating projection methods (Q1923044) (← links)
- Shape restricted nonparametric regression with Bernstein polynomials (Q1927049) (← links)
- Alternating conditional gradient method for convex feasibility problems (Q2044579) (← links)
- Model-based distance embedding with applications to chromosomal conformation biology (Q2170380) (← links)
- Strong convergence of a self-adaptive method for the split feasibility problem (Q2253220) (← links)
- Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming (Q2277367) (← links)
- Dykstra's splitting and an approximate proximal point algorithm for minimizing the sum of convex functions (Q2322367) (← links)
- Dual coordinate ascent methods for non-strictly convex minimization (Q2368079) (← links)
- How good are projection methods for convex feasibility problems? (Q2427393) (← links)
- A finite steps algorithm for solving convex feasibility problems (Q2460116) (← links)
- Approximate Toeplitz matrix problem using semidefinite programming (Q2483033) (← links)
- Computational acceleration of projection algorithms for the linear best approximation problem (Q2497243) (← links)
- Set intersection problems: supporting hyperplanes and quadratic programming (Q2515044) (← links)
- An iteration method to solve multiple constrained least squares problems (Q2628358) (← links)
- Dykstras algorithm with bregman projections: A convergence proof (Q2709445) (← links)
- Comparative Study of Different Penalty Functions and Algorithms in Survey Calibration (Q2958616) (← links)
- A new duality theory for mathematical programming (Q3112511) (← links)
- Decomposition Methods for Sparse Matrix Nearness Problems (Q3456880) (← links)
- Unrestricted iterations of nonexpansive mappings in Hilbert space (Q4008908) (← links)
- The rate of convergence of dykstra's cyclic projections algorithm: The polyhedral case (Q4302536) (← links)
- Alternating convex projection methods for covariance control design (Q4326830) (← links)
- Minimizing certain convex functions over the intersection of the fixed point sets of nonexpansive mappings (Q4386120) (← links)
- Quadratic optimization of fixed points of nonexpansive mappings in hubert space (Q4386129) (← links)
- Rank reduction of correlation matrices by majorization (Q4610275) (← links)
- Distributed Deterministic Asynchronous Algorithms in Time-Varying Graphs Through Dykstra Splitting (Q4624929) (← links)
- Unrestricted iterations of nonexpansive mappings in Banach spaces (Q4695761) (← links)
