Finding the common point of a system of convex sets and solving mathematical-programming optimization problems by the orthogonal descent method (Q1899543): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An orthogonal descent algorithm to find the zero of a convex function, unsolvability test, and rate of convergence / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3323137 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4110807 / rank | |||
Normal rank | |||
Latest revision as of 16:38, 23 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding the common point of a system of convex sets and solving mathematical-programming optimization problems by the orthogonal descent method |
scientific article |
Statements
Finding the common point of a system of convex sets and solving mathematical-programming optimization problems by the orthogonal descent method (English)
0 references
2 November 1995
0 references
orthogonal descent method
0 references
common point of a linear manifold and an arbitrary convex set
0 references
0 references
