scientific article

Publication date: 1986

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Hilbert space least squares projections onto convex regions

Programming in abstract spaces (90C48) Convex sets in topological vector spaces (aspects of convex geometry) (52A07) Inner product spaces and their generalizations, Hilbert spaces (46C99) Numerical approximation and computational geometry (primarily algorithms) (65D99) Numerical methods in optimal control (49M99)

Related Items

Inexact variable metric method for convex-constrained optimization problems, Product of two positive contractions, Convergence of a randomized Douglas-Rachford method for linear system, Model-Based Derivative-Free Methods for Convex-Constrained Optimization, Fundamentals of cone regression, Robust \(\ell_1\) approaches to computing the geometric median and principal and independent components, Proximal Splitting Methods in Signal Processing, An iteration method to solve multiple constrained least squares problems, Conic optimization via operator splitting and homogeneous self-dual embedding, String-averaging methods for best approximation to common fixed point sets of operators: the finite and infinite cases, Anderson acceleration of the alternating projections method for computing the nearest correlation matrix, Decomposition Methods for Sparse Matrix Nearness Problems, Efficient projection onto a low-dimensional ball, \(t\)-copula from the viewpoint of tail dependence matrices, ALSO-X and ALSO-X+: Better Convex Approximations for Chance Constrained Programs, The rate of convergence for the cyclic projections algorithm. I: Angles between convex sets, Total Variation on a Tree, Variational multiscale nonparametric regression: smooth functions, Monotone operator theory in convex optimization, Modeling Persistent Trends in Distributions, A dual approach to constrained interpolation from a convex subset of Hilbert space, Convergence guarantee for the sparse monotone single index model, SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning, Low-order control design for LMI problems using alternating projection methods, A Mann type hybrid generalized \(f\)-projection iterative method for a class of nonlinear mappings, A splitting method for finding the resolvent of the sum of two maximal monotone operators, A new approach to the approximation of common fixed points of an infinite family of relatively quasinonexpansive mappings with applications, Dykstra's algorithm for constrained least-squares rectangular matrix problems, On the first degree Fejér-Riesz factorization and its applications to \(X+A^{\ast}X^{-1}A=Q\), Partitioning through projections: strong SDP bounds for large graph partition problems, Zeroth-order feedback optimization for cooperative multi-agent systems, A Distributed Boyle--Dykstra--Han Scheme, Construction of quantum states with special properties by projection methods, Douglas–Rachford algorithm for control-constrained minimum-energy control problems, On a numerical construction of doubly stochastic matrices with prescribed eigenvalues, Stochastic Reformulations of Linear Systems: Algorithms and Convergence Theory, Pooling adjacent violators under interval constraints, Reducing the projection onto the monotone extended second-order cone to the pool-adjacent-violators algorithm of isotonic regression, Convergence Rate Analysis of a Dykstra-Type Projection Algorithm, Estimation of Monge matrices, Optimal micropatterns in 2D transport networks and their relation to image inpainting, Selective alternating projections to find the nearest SDD\(^{+}\) matrix, Statistical multiresolution Dantzig estimation in imaging: fundamental concepts and algorithmic framework, Strong convergence by the shrinking effect of two half-spaces and applications, Blind separation of non-negative source signals using multiplicative updates and subspace projection, 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, Proximal methods for the latent group lasso penalty, Representation of individual differences in rectangular proximity data through anti-Q matrix decomposition, Distributed Deterministic Asynchronous Algorithms in Time-Varying Graphs Through Dykstra Splitting, A stable method solving the total variation dictionary model with \(L^\infty\) constraints, On Dykstra's algorithm: finite convergence, stalling, and the method of alternating projections, A constrained matrix least-squares problem in structural dynamics model updating, Accelerating the alternating projection algorithm for the case of affine subspaces using supporting hyperplanes, Strengthened splitting methods for computing resolvents, Optimal \(H_ \infty\) model reduction via linear matrix inequalities: continuous- and discrete-time cases, Un problème d'approximation matricielle : quelle est la matrice bistochastique la plus proche d'une matrice donnée ?, Induced \(\mathfrak{L}_ 2\) norm model reduction of polytopic uncertain linear systems, Numerical methods for solving some matrix feasibility problems, Unnamed Item, An iterated projection approach to variational problems under generalized convexity constraints, A new projection method for finding the closest point in the intersection of convex sets, A cyclic Douglas-Rachford iteration scheme, Convex constrained optimization for large-scale generalized Sylvester equations, Proximity for sums of composite functions, Autocovariance Estimation in Regression with a Discontinuous Signal and m‐Dependent Errors: A Difference‐Based Approach, A complex projection scheme and applications, Hybrid shrinking iterative solutions to convex feasibility problems for countable families of relatively nonexpansive mappings and a system of generalized mixed equilibrium problems, Dykstra's algorithm for constrained least-squares doubly symmetric matrix problems, Computational acceleration of projection algorithms for the linear best approximation problem, Error reduction in density estimation under shape restrictions, Approximating the minimum rank of a graph via alternating projection, Construction of best Bregman approximations in reflexive Banach spaces, Generalized Sinkhorn Iterations for Regularizing Inverse Problems Using Optimal Mass Transport, Proximal Distance Algorithms: Theory and Examples, Statistical multiresolution estimation for variational imaging: with an application in Poisson-biophotonics, A Tailored Multivariate Mixture Model for Detecting Proteins of Concordant Change Among Virulent Strains of Clostridium Perfringens, Maximum likelihood estimates via duality for log-convex models when cell probabilities are subject to convex constraints, A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions, Successive approximate algorithm for best approximation from a polyhedron, On the inexact scaled gradient projection method, Dykstra's splitting and an approximate proximal point algorithm for minimizing the sum of convex functions, The Convex Mixture Distribution: Granger Causality for Categorical Time Series, Dykstra's algorithm with strategies for projecting onto certain polyhedral cones, The Supporting Halfspace--Quadratic Programming Strategy for the Dual of the Best Approximation Problem, The superiorization method with restarted perturbations for split minimization problems with an application to radiotherapy treatment planning, Generating Correlation Matrices With Specified Eigenvalues Using the Method of Alternating Projections, Linear Convergence of Random Dual Coordinate Descent on Nonpolyhedral Convex Problems, Efficient global minimization methods for image segmentation models with four regions, Exact Worst-Case Performance of First-Order Methods for Composite Convex Optimization