Proximity Maps for Convex Sets
From MaRDI portal
Publication:3267714
DOI10.2307/2032864zbMath0092.11403OpenAlexW4236033278MaRDI QIDQ3267714
E. W. Cheney, Allen A. Goldstein
Publication date: 1959
Full work available at URL: https://doi.org/10.2307/2032864
Related Items
Structured low rank approximation, Finding a best approximation pair of points for two polyhedra, Reconstruction from measurements of positive quantities by the maximum- like method, Proximal Splitting Methods in Signal Processing, On iteration complexity of a first-order primal-dual method for nonlinear convex cone programming, Circumcentering approximate reflections for solving the convex feasibility problem, A symmetric grouped and ordered multi-secant Quasi-Newton update formula, Phase retrieval with one or two diffraction patterns by alternating projections with the null initialization, Applications of the proximity map to fixed point theorems in Hilbert space, Approximation technique in fixed point theory, Some convergence strategies for the alternating generalized projection method, An algorithm for constructing convexity and monotonicity-preserving splines in tension, Alternating convex projection methods for discrete-time covariance control design, Alternating-projection algorithms for operator-theoretic calculations, The difference vectors for convex sets and a resolution of the geometry conjecture, New general convergence theory for iterative processes and its applications to Newton-Kantorovich type theorems, Finding best approximation pairs relative to two closed convex sets in Hilbert spaces, A cyclic projection algorithm via duality, Low-order control design for LMI problems using alternating projection methods, Projections onto closed convex sets in Hilbert spaces, New fixed-points results for 1-set contractive set valued maps, Newton's method for convex programming and Tschebyscheff approximation, Polyak's gradient method for split feasibility problem constrained by level sets, Nonexpansive homeomorphisms, The Douglas-Rachford algorithm for convex and nonconvex feasibility problems, Automated Multilateral Negotiation on Multiple Issues with Private Information, On a numerical construction of doubly stochastic matrices with prescribed eigenvalues, Asymptotic behavior of a periodic sequence of nonexpansive mappings with applications, Approximating properties of metric and generalized metric projections in uniformly convex and uniformly smooth Banach spaces, On the structure of regularization paths for piecewise differentiable regularization terms, Robust static and fixed-order dynamic output feedback control of discrete-time parametric uncertain Luré systems: Sequential SDP relaxation approaches, A note on alternating projections in Hilbert space, Estimation of a nonlinear panel data model with semiparametric individual effects, Unnamed Item, Structure-Preserving Function Approximation via Convex Optimization, There is no variational characterization of the cycles in the method of periodic projections, Local linear convergence of approximate projections onto regularized sets, A projection scheme to stability analysis of discrete T-S fuzzy models., On Ky Fan's theorem and its applications, Statistical modeling under partial identification: distinguishing three types of identification regions in regression analysis with interval data, A constrained matrix least-squares problem in structural dynamics model updating, On the convergence of Han's method for convex programming with quadratic objective, Iterative algorithm for solving a class of convex feasibility problem, Optimal \(H_ \infty\) model reduction via linear matrix inequalities: continuous- and discrete-time cases, Approximation results and fixed points, Fast L1-L2 minimization via a proximal operator, Hilbertian convex feasibility problem: Convergence of projection methods, Numerical methods for solving some matrix feasibility problems, Alternating projection method for doubly stochastic inverse eigenvalue problems with partial eigendata, Analysis of the parallel Schwarz method for growing chains of fixed-sized subdomains. III., Frame completion with prescribed norms via alternating projection method, A cyclic Douglas-Rachford iteration scheme, 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, A complex projection scheme and applications, Approximation theorems and fixed point theorems for various classes of 1-set-contractive mappings in Banach spaces, Compositions and averages of two resolvents: relative geometry of fixed points sets and a partial answer to a question by C.\,Byrne, Reflection-projection method for convex feasibility problems with an obtuse cone, Stability analysis of discrete singular fuzzy systems, The asymptotic behavior of the composition of two resolvents, Dykstra's algorithm for constrained least-squares doubly symmetric matrix problems, A characterization of smooth normed linear spaces, Secant update generalized version of PSB: a new approach, Boundary non-crossing probabilities of Gaussian processes: sharp bounds and asymptotics, An efficient descent method for locally Lipschitz multiobjective optimization problems, Solving composite fixed point problems with block updates, Elasticity \(\mathcal{M} \)-tensors and the strong ellipticity condition, The circumcentered-reflection method achieves better rates than alternating projections, Alternating conditional gradient method for convex feasibility problems, Constraint reduction reformulations for projection algorithms with applications to wavelet construction, A polynomial algorithm for convex quadratic optimization subject to linear inequalities, Acceleration schemes for the method of alternating projections, On iterative methods for solving nonlinear least squares problems over convex sets, Approximation and fixed-point theorems for condensing composites of multifunctions, A note on the finite convergence of alternating projections, Finding best approximation pairs for two intersections of closed convex sets, Scalable Bayesian Uncertainty Quantification in Imaging Inverse Problems via Convex Optimization, Optimale Interpolations- und Approximationssysteme, On the convergence of the continuous gradient projection method, The method of cyclic projections for closed convex sets in a Hilbert space under the presence of computational errors, Hybrid methods for solving the educational testing problem, Dykstra's algorithm with strategies for projecting onto certain polyhedral cones, Some Random Fixed Point Theorems for Condensing Operators, Global convergence of the alternating projection method for the Max-Cut relaxation problem, MEAN–VARIANCE PORTFOLIO MANAGEMENT WITH FUNCTIONAL OPTIMIZATION, Proximity maps and fixed points, Method of Alternating Contractions and Its Applications to Some Convex Optimization Problems, Convex programming in Hilbert space, Infeasibility and Error Bound Imply Finite Convergence of Alternating Projections, Best Approximation in Nonlinear Functional Analysis, Projections onto convex cones in Hilbert space, Accessibility of solutions of operator equations by Newton-like methods, Random Approximations and Random Fixed Point Theorems for Non-Self-Maps, Optimal matrix approximants in structural identification
Cites Work
