Pages that link to "Item:Q1123122"

The following pages link to Interior path following primal-dual algorithms. II: Convex quadratic programming (Q1123122):

Displaying 32 items.

• Research Article: On Extending Primal-Dual Interior-Point Method for Linear Optimization to Convex Quadratic Symmetric Cone Optimization (Q2841915) (← links)
• A new primal-dual polynomial algorithm for convex quadratic programming (Q2858217) (← links)
• A full-step interior-point algorithm for linear complementarity problem based on a simple function (Q2903245) (← links)
• Short-step primal-dual target-following algorithms for the convex quadratic problems (Q2913902) (← links)
• A wide neighborhood arc-search interior-point algorithm for convex quadratic programming (Q3176174) (← links)
• Global convergence analysis of the aggregate constraint homotopy method for nonlinear programming problems with both inequality and equality constraints (Q3177632) (← links)
• A New Wide Neighborhood Primal-Dual Predictor-Corrector Interior-Point Method for Linear Programming (Q3188443) (← links)
• A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension (Q3200877) (← links)
• MINIMIZING TOTAL WEIGHTED EARLINESS-TARDINESS ON A SINGLE MACHINE AROUND A SMALL COMMON DUE DATE: AN FPTAS USING QUADRATIC KNAPSACK (Q3569281) (← links)
• An iterative solver-based long-step infeasible primal-dual path-following algorithm for convex QP based on a class of preconditioners (Q3603659) (← links)
• A Polynomial Method of Weighted Centers for Convex Quadratic Programming (Q3976933) (← links)
• A path following algorithm for a class of convex programming problems (Q4016864) (← links)
• Numerical methods of nonlinear optimal control based on mathematical programming (Q4374282) (← links)
• The BPMPD interior point solver for convex quadratic problems (Q4504788) (← links)
• LOQO:an interior point code for quadratic programming (Q4504789) (← links)
• Interior point methods, a decade after Karmarkar—a survey, with application to the smallest eigenvalue problem (Q4715798) (← links)
• A resolução do problema de despacho ótimo de reativos pelo método da função lagrangiana-barreira relaxada (Q4905610) (← links)
• A new potential reduction algorithm for smooth convex programming (Q4944415) (← links)
• A New Predictor-corrector Infeasible Interior-point Algorithm for Linear Optimization in aWide Neighborhood (Q4988920) (← links)
• Analysis of some interior point continuous trajectories for convex programming (Q5277955) (← links)
• A new primal-dual interior-point algorithm for convex quadratic optimization (Q5320227) (← links)
• Identifying superfluous constraints within an interior-point algorithm for convex quadratic programming (Q5423153) (← links)
• (Q5442492) (← links)
• Une procédure de purification pour les problèmes de complémentarité linéaire, monotones (Q5479841) (← links)
• The aggregate constraint homotopy method for nonconvex nonlinear programming (Q5946387) (← links)
• General central path and the largest step general central path following algorithm for linear programming (Q5949520) (← links)
• Some Strongly Polynomially Solvable Convex Quadratic Programs with Bounded Variables (Q6161304) (← links)
• An infeasible interior-point technique to generate the nondominated set for multiobjective optimization problems (Q6164611) (← links)
• Log-domain interior-point methods for convex quadratic programming (Q6164958) (← links)
• A polynomial time infeasible interior-point arc-search algorithm for convex optimization (Q6173777) (← links)
• Semi-definite programming and quantum information (Q6561827) (← links)
• A large-update primal-dual interior-point algorithm for convex quadratic optimization based on a new bi-parameterized bi-hyperbolic Kernel function (Q6586751) (← links)