Pages that link to "Item:Q583119"

The following pages link to Global ellipsoidal approximations and homotopy methods for solving convex analytic programs (Q583119):

Displaying 20 items.

• An interior point algorithm of O\((\sqrt m| \ln\varepsilon |)\) iterations for \(C^ 1\)-convex programming (Q687091) (← links)
• Applications of the notion of analytic center in approximation (estimation) problems (Q912570) (← links)
• A globally convergent interior point algorithm for non-convex nonlinear programming (Q1002202) (← links)
• On some efficient interior point methods for nonlinear convex programming (Q1174840) (← links)
• An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems (Q1176569) (← links)
• On the complexity of following the central path of linear programs by linear extrapolation. II (Q1181914) (← links)
• A barrier function method for minimax problems (Q1186276) (← links)
• Interior-point methods for convex programming (Q1205507) (← links)
• Estimating the complexity of a class of path-following methods for solving linear programs by curvature integrals (Q1205513) (← links)
• Optimal ellipsoidal approximations around the analytic center (Q1330921) (← links)
• A combined homotopy interior point method for general nonlinear programming problems (Q1354287) (← links)
• A combined homotopy interior point method for convex nonlinear programming (Q1368923) (← links)
• An interior-point method for fractional programs with convex constraints (Q1804653) (← links)
• An interior-point method for multifractional programs with convex constraints (Q1893345) (← links)
• An interior-point method for semi-infinite programming problems (Q1915915) (← links)
• On the convergence of the method of analytic centers when applied to convex quadratic programs (Q2277366) (← links)
• Theoretical convergence of large-step primal-dual interior point algorithms for linear programming (Q2366605) (← links)
• A polynomial path following algorithm for convex programming (Q2479155) (← links)
• Path-following barrier and penalty methods for linearly constrained problems (Q2709451) (← links)
• Computation of the distance to semi-algebraic sets (Q4941311) (← links)