Pages that link to "Item:Q1321158"

The following pages link to On the classical logarithmic barrier function method for a class of smooth convex programming problems (Q1321158):

Displaying 21 items.

• Feasible method for generalized semi-infinite programming (Q604267) (← links)
• A long-step barrier method for convex quadratic programming (Q689102) (← links)
• Interior-point methods for convex programming (Q1205507) (← links)
• Condition measures and properties of the central trajectory of a linear program (Q1290648) (← links)
• Global linear convergence of a path-following algorithm for some monotone variational inequality problems (Q1321256) (← links)
• Controlled dual perturbations for central path trajectories in geometric programming (Q1328646) (← links)
• A globally convergent primal-dual interior point algorithm for convex programming (Q1330897) (← links)
• Convergence property of the Iri-Imai algorithm for some smooth convex programming problems (Q1335125) (← links)
• Volumetric path following algorithms for linear programming (Q1361113) (← links)
• Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems (Q1366422) (← links)
• A combined homotopy interior point method for convex nonlinear programming (Q1368923) (← links)
• On the complexity of linear programming under finite precision arithmetic (Q1380938) (← links)
• Improving complexity of structured convex optimization problems using self-concordant barriers (Q1848383) (← links)
• Nonlinear coordinate representations of smooth optimization problems (Q1905043) (← links)
• The Newton modified barrier method for QP problems (Q1915923) (← links)
• Interior-point methods for nonlinear complementarity problems (Q1918290) (← links)
• An interior point parameterized central path following algorithm for linearly constrained convex programming (Q2113635) (← links)
• Constructing IGA-suitable planar parameterization from complex CAD boundary by domain partition and global/local optimization (Q2310126) (← links)
• Long-step path-following algorithm for solving symmetric programming problems with nonlinear objective functions (Q2419536) (← links)
• Long-step path-following algorithm for quantum information theory: some numerical aspects and applications (Q2673269) (← links)
• Interior point methods, a decade after Karmarkar—a survey, with application to the smallest eigenvalue problem (Q4715798) (← links)