Pages that link to "Item:Q4018385"
From MaRDI portal
The following pages link to A Large-Step Analytic Center Method for a Class of Smooth Convex Programming Problems (Q4018385):
Displaying 16 items.
- An interior point algorithm of O\((\sqrt m| \ln\varepsilon |)\) iterations for \(C^ 1\)-convex programming (Q687091) (← links)
- A long-step barrier method for convex quadratic programming (Q689102) (← links)
- Quadratically constrained convex quadratic programmes: Faculty feasible regions (Q1278283) (← links)
- On infeasibility of systems of convex analytic inequalities (Q1295897) (← links)
- On the classical logarithmic barrier function method for a class of smooth convex programming problems (Q1321158) (← links)
- A globally convergent primal-dual interior point algorithm for convex programming (Q1330897) (← links)
- On Davidon's collinear scaling algorithms for optimization (Q1332350) (← links)
- Convergence property of the Iri-Imai algorithm for some smooth convex programming problems (Q1335125) (← links)
- A combined homotopy interior point method for convex nonlinear programming (Q1368923) (← links)
- Minimal representation of convex regions defined by analytic functions (Q1577971) (← links)
- Potential reduction method for harmonically convex programming (Q1893464) (← links)
- On convex optimization with linear constraints (Q1905040) (← links)
- A primal-dual potential reduction method for problems involving matrix inequalities (Q1922696) (← links)
- Impproving the rate of convergence of the logarithmic barrier function method (Q4351191) (← links)
- On complexity of the translational-cut algorithm for convex minimax problems (Q5925720) (← links)
- Solving the discrete \(l_p\)-approximation problem by a method of centers (Q5936070) (← links)
