Projection onto simplicial cones by Picard's method
From MaRDI portal
Publication:2348931
Abstract: By using Moreau's decomposition theorem for projecting onto cones, the problem of projecting onto a simplicial cone is reduced to finding the unique solution of a nonsmooth system of equations. It is shown that Picard's method applied to the system of equations associated to the problem of projecting onto a simplicial cone generates a sequence that converges linearly to the solution of the system. Numerical experiments are presented making the comparison between Picard's and semi-smooth Newton's methods to solve the nonsmooth system associated with the problem of projecting a point onto a simplicial cone.
Recommendations
Cites work
- A critical index algorithm for nearest point problems on simplicial cones
- A duality between the metric projection onto a convex cone and the metric projection onto its dual
- A geometrical approach to iterative isotone regression
- Active set algorithms for isotonic regression; a unifying framework
- An active index algorithm for the nearest point problem in a polyhedral cone
- An Algorithm for Restricted Least Squares Regression
- An Exact Algorithm for Projection onto a Polyhedral Cone
- Analytic Results for the Eigenvalues of Certain Tridiagonal Matrices
- Benchmarking optimization software with performance profiles.
- Characterization of latticial cones in Hilbert spaces by isotonicity and generalized infimum
- Component averaging: An efficient iterative parallel algorithm for large and sparse unstructured problems
- Computing Projections into Cones Generated by a Matrix
- Dual Cones, Dual Norms, and Simultaneous Inference for Partially Ordered Means
- Dykstra's algorithm with strategies for projecting onto certain polyhedral cones
- Estimation of the convergence rate of Dykstra's cyclic projections algorithm in polyhedral case
- Exterior point algorithms for nearest points and convex quadratic programs
- How to project onto an isotone projection cone
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 3177945 (Why is no real title available?)
- scientific article; zbMATH DE number 94857 (Why is no real title available?)
- scientific article; zbMATH DE number 192986 (Why is no real title available?)
- scientific article; zbMATH DE number 193111 (Why is no real title available?)
- scientific article; zbMATH DE number 3574390 (Why is no real title available?)
- scientific article; zbMATH DE number 5263160 (Why is no real title available?)
- scientific article; zbMATH DE number 3390139 (Why is no real title available?)
- Incomplete oblique projections for solving large inconsistent linear systems
- Inversion of a tridiagonal Jacobi matrix
- Inversion of Jacobi's tridiagonal matrix
- Isotone retraction cones in Hilbert spaces
- Monotonicity of metric projection onto positive cones of ordered Euclidean spaces
- Monotonicity recovering and accuracy preserving optimization methods for postprocessing finite element solutions
- Nonlinear Programming
- On Diagonally Relaxed Orthogonal Projection Methods
- On Projection Algorithms for Solving Convex Feasibility Problems
- On recursive formulas for isotonic regression useful for statistical inference under order restrictions
- On the eigenvalues of some tridiagonal matrices
- On the Perturbation of Pseudo-Inverses, Projections and Linear Least Squares Problems
- Practical issues on the projection of polyhedral sets
- Projection onto simplicial cones by a semi-smooth Newton method
- Projections onto order simplexes
- Properties of Some Tridiagonal Matrices and Their Application to Boundary Value Problems
- Solving nonlinear complementarity problems by isotonicity of the metric projection
- The nearest point problem in a polyhedral set and its extensions
- The rate of convergence of dykstra's cyclic projections algorithm: The polyhedral case
Cited in
(11)- Projecting a simplex onto another one
- Projection onto simplicial cones by a semi-smooth Newton method
- On the convergence of iterative schemes for solving a piecewise linear system of equations
- On the projection onto a finitely generated cone
- Projection on the intersection of convex sets
- A semi-smooth Newton method for projection equations and linear complementarity problems with respect to the second order cone
- An algorithm for projecting onto simplicial cones
- A semi-smooth Newton method for a special piecewise linear system with application to positively constrained convex quadratic programming
- A two-steps fixed-point method for the simplicial cone constrained convex quadratic optimization
- Projections onto polyhedral sets: an improved finite step method and new distributed projection methods
- A semi-smooth Newton method for general projection equations applied to the nearest correlation matrix problem
This page was built for publication: Projection onto simplicial cones by Picard's method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2348931)
