Proximal interior point approach in convex programming (ill-posed problems)<sup>*</sup><sup>†</sup> (Q4265520): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Penalization in non-classical convex programming via variational convergence / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3343711 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Penalty-proximal methods in convex programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4295274 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Convex Analysis / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Monotone Operators and the Proximal Point Algorithm / rank | |||
Normal rank |
Latest revision as of 21:45, 28 May 2024
scientific article; zbMATH DE number 1339712
Language | Label | Description | Also known as |
---|---|---|---|
English | Proximal interior point approach in convex programming (ill-posed problems)<sup>*</sup><sup>†</sup> |
scientific article; zbMATH DE number 1339712 |
Statements
Proximal interior point approach in convex programming (ill-posed problems)<sup>*</sup><sup>†</sup> (English)
0 references
22 September 1999
0 references
Interior Point Method
0 references
Convex Optimization
0 references
ill-posed Problem
0 references
Proximal Point Algorithm
0 references
0 references