Pages that link to "Item:Q2764699"
From MaRDI portal
The following pages link to An infeasible interior proximal method for convex programming problems with linear constraints (Q2764699):
Displaying 5 items.
- Maximal monotone operators and the proximal point algorithm in the presence of computational errors (Q637560) (← links)
- Inexact proximal point methods in metric spaces (Q763334) (← links)
- Interior proximal algorithm for quasiconvex programming problems and variational inequalities with linear constraints (Q1762409) (← links)
- An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities (Q1924060) (← links)
- Rescaled proximal methods for linearly constrained convex problems (Q3515390) (← links)