Pages that link to "Item:Q687091"

The following pages link to An interior point algorithm of O\((\sqrt m| \ln\varepsilon |)\) iterations for \(C^ 1\)-convex programming (Q687091):

Displaying 9 items.

• Quadratic cost flow and the conjugate gradient method (Q707094) (← links)
• Superlinearly convergent approximate Newton methods for LC\(^ 1\) optimization problems (Q1332309) (← links)
• On piecewise quadratic Newton and trust region problems (Q1356055) (← links)
• Approximate Newton methods for nonsmooth equations (Q1379958) (← links)
• New version of the Newton method for nonsmooth equations (Q1379959) (← links)
• Potential reduction method for harmonically convex programming (Q1893464) (← links)
• Inexact Newton methods for solving nonsmooth equations (Q1900757) (← links)
• A convergence analysis for a convex version of Dikin's algorithm (Q1915918) (← links)
• Complexity analysis for certain convex programming problems (Q1974569) (← links)