Projection onto simplicial cones by a semi-smooth Newton method
From MaRDI portal
Publication:2341098
DOI10.1007/s11590-014-0775-1zbMath1342.90121arXiv1404.2427OpenAlexW1985148584MaRDI QIDQ2341098
Orizon P. Ferreira, Sándor Zoltan Németh
Publication date: 23 April 2015
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1404.2427
Related Items
Projection on the intersection of convex sets, On the convergence of iterative schemes for solving a piecewise linear system of equations, 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, Projection onto simplicial cones by Picard's method, Isotonicity of the metric projection with respect to the mutually dual orders and complementarity problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An active index algorithm for the nearest point problem in a polyhedral cone
- The steepest descent gravitational method for linear programming
- Characterization of latticial cones in Hilbert spaces by isotonicity and generalized infimum
- Solving nonlinear complementarity problems by isotonicity of the metric projection
- Exterior point algorithms for nearest points and convex quadratic programs
- The nearest point problem in a polyhedral set and its extensions
- How to project onto an isotone projection cone
- Isotone retraction cones in Hilbert spaces
- A generalized Newton method for absolute value equations
- Monotonicity of metric projection onto positive cones of ordered Euclidean spaces
- Practical issues on the projection of polyhedral sets
- Estimation of the convergence rate of Dykstra's cyclic projections algorithm in polyhedral case
- Incomplete oblique projections for solving large inconsistent linear systems
- Dykstra's algorithm with strategies for projecting onto certain polyhedral cones
- On the Projection onto a Finitely Generated Cone
- Dual Cones, Dual Norms, and Simultaneous Inference for Partially Ordered Means
- An Algorithm for Restricted Least Squares Regression
- On Diagonally Relaxed Orthogonal Projection Methods
- A critical index algorithm for nearest point problems on simplicial cones
- On the Perturbation of Pseudo-Inverses, Projections and Linear Least Squares Problems
- An Exact Algorithm for Projection onto a Polyhedral Cone
- The rate of convergence of dykstra's cyclic projections algorithm: The polyhedral case
- Computing Projections into Cones Generated by a Matrix
- On Projection Algorithms for Solving Convex Feasibility Problems
- Nonlinear Programming
- Component averaging: An efficient iterative parallel algorithm for large and sparse unstructured problems
