Pages that link to "Item:Q3705225"

The following pages link to A Computational Comparison of the Ellipsoid Algorithm with Several Nonlinear Programming Algorithms (Q3705225):

Displaying 11 items.

• A numerical investigation of rank-two ellipsoid algorithms for nonlinear programming (Q1123811) (← links)
• A deep cut ellipsoid algorithm for convex programming: Theory and applications (Q1315434) (← links)
• Using two successive subgradients in the ellipsoid method for nonlinear programming (Q1337226) (← links)
• Simplices by point-sliding and the Yamnitsky-Levin algorithm (Q1366323) (← links)
• Active set strategies in an ellipsoid algorithm for nonlinear programming (Q1433159) (← links)
• An application of nonlinear optimization in molecular biology (Q1600927) (← links)
• A derivative-based bracketing scheme for univariate minimization and the conjugate gradient method (Q1825603) (← links)
• Solving nonlinear principal-agent problems using bilevel programming (Q2355956) (← links)
• (Q3313619) (← links)
• A class of algorithms for computing the minimal value of a convex function<i>f</i>over[0 1]<i>^k</i>within accuracy ∊, when the evaluations of<i>f</i>are made within accuracy ∊ (Q3727747) (← links)
• (Q5256993) (← links)