A two-steps fixed-point method for the simplicial cone constrained convex quadratic optimization (Q6963613)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8060018
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A two-steps fixed-point method for the simplicial cone constrained convex quadratic optimization |
scientific article; zbMATH DE number 8060018 |
Statements
A two-steps fixed-point method for the simplicial cone constrained convex quadratic optimization (English)
0 references
7 July 2025
0 references
quadratic programming
0 references
simplicial cones
0 references
absolute value equations
0 references
linear complementarity problem
0 references
Picard's fixed point iterative method
0 references
0 references
0 references
