Pages that link to "Item:Q1205507"
From MaRDI portal
The following pages link to Interior-point methods for convex programming (Q1205507):
Displaying 8 items.
- Computation of the distance to semi-algebraic sets (Q4941311) (← links)
- Interior Point Methods Can Exploit Structure of Convex Piecewise Linear Functions with Application in Radiation Therapy (Q5067430) (← links)
- Complexity Analysis of a Sampling-Based Interior Point Method for Convex Optimization (Q5076724) (← links)
- Hessian distances and their applications in the complexity analysis of interior-point methods (Q5299911) (← links)
- (Q5750728) (← links)
- Inner approximation method for a reverse convex programming problem (Q5925727) (← links)
- Maintaining closeness to the analytic center of a polytope by perturbing added hyperplanes (Q5961567) (← links)
- A polynomial time infeasible interior-point arc-search algorithm for convex optimization (Q6173777) (← links)