A successive projection method
From MaRDI portal
Publication:1262213
DOI10.1007/BF01580719zbMath0685.90074OpenAlexW2016425264MaRDI QIDQ1262213
Publication date: 1988
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01580719
parallel computationconvergence propertiessubproblemsprojection of a pointsuccessive projectionstructured sparse problems
Related Items
Structured low rank approximation, A row-action method for convex programming, Dual coordinate ascent methods for non-strictly convex minimization, Fundamentals of cone regression, An iteration method to solve multiple constrained least squares problems, A multiprojection algorithm using Bregman projections in a product space, A non-interior continuation algorithm for solving the convex feasibility problem, Projection on the intersection of convex sets, Decomposition Methods for Sparse Matrix Nearness Problems, Primal-dual row-action method for convex programming, Unrestricted iterations of nonexpansive mappings in Hilbert space, Model-based distance embedding with applications to chromosomal conformation biology, SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning, Efficient rank reduction of correlation matrices, Solving Hankel matrix approximation problem using semidefinite programming, The rate of convergence of dykstra's cyclic projections algorithm: The polyhedral case, A cyclic projection algorithm via duality, Low-order control design for LMI problems using alternating projection methods, Shape restricted nonparametric regression with Bernstein polynomials, Finding projections onto the intersection of convex sets in hilbert spaces, A Distributed Boyle--Dykstra--Han Scheme, Comparative Study of Different Penalty Functions and Algorithms in Survey Calibration, Alternating convex projection methods for covariance control design, How good are projection methods for convex feasibility problems?, Convergence Rate Analysis of a Dykstra-Type Projection Algorithm, Rank reduction of correlation matrices by majorization, Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces., Actuarial Risk Matrices: The Nearest Positive Semidefinite Matrix Problem, Dykstras algorithm with bregman projections: A convergence proof, Computing the nearest Euclidean distance matrix with low embedding dimensions, Distributed Deterministic Asynchronous Algorithms in Time-Varying Graphs Through Dykstra Splitting, The embedding problem for predistance matrices, Optimality tests for partitioning and sectional search algorithms, On the convergence of Han's method for convex programming with quadratic objective, A finite steps algorithm for solving convex feasibility problems, Contraction and uniform convergence of isotonic regression, Optimal \(H_ \infty\) model reduction via linear matrix inequalities: continuous- and discrete-time cases, Alternating projection method for sparse model updating problems, Minimizing certain convex functions over the intersection of the fixed point sets of nonexpansive mappings, Quadratic optimization of fixed points of nonexpansive mappings in hubert space, Strong convergence of a self-adaptive method for the split feasibility problem, The nearest point problem in a polyhedral set and its extensions, Approximate Toeplitz matrix problem using semidefinite programming, An active index algorithm for the nearest point problem in a polyhedral cone, Estimating a Convex Function in Nonparametric Regression, Dykstra's algorithm for constrained least-squares doubly symmetric matrix problems, Computational acceleration of projection algorithms for the linear best approximation problem, Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming, Unrestricted iterations of nonexpansive mappings in Banach spaces, Set intersection problems: supporting hyperplanes and quadratic programming, Alternating conditional gradient method for convex feasibility problems, Semidefinite and second-order cone optimization approach for the Toeplitz matrix approximation problem, Dykstra's splitting and an approximate proximal point algorithm for minimizing the sum of convex functions, A new duality theory for mathematical programming, The Supporting Halfspace--Quadratic Programming Strategy for the Dual of the Best Approximation Problem, On the unrestricted iteration of projections in Hilbert space, Asymptotic properties of the Fenchel dual functional and applications to decomposition problems, Computation of efficient compromise arcs in convex quadratic multicriteria optimization
Cites Work
