Pages that link to "Item:Q1121792"

The following pages link to An extension of Karmarkar's projective algorithm for convex quadratic programming (Q1121792):

Displaying 18 items.

• A wide neighborhood arc-search interior-point algorithm for convex quadratic programming (Q3176174) (← links)
• An Infeasible Mizuno–Todd–Ye Type Algorithm for Convex Quadratic Programming with Polynomial Complexity (Q3444677) (← links)
• An experimental approach to karmarkar’s projective method for linear programming (Q3773690) (← links)
• Generalized sensitivity analysis of nonlinear programs using a sequence of quadratic programs (Q4634162) (← links)
• An extended projective formula and its application to semidefinite optimization (Q4902856) (← links)
• A new potential reduction algorithm for smooth convex programming (Q4944415) (← links)
• Optimal portfolio execution under time-varying liquidity constraints (Q5373911) (← links)
• Properties Of Primal Interior Point Methods For QP^∗ (Q5689843) (← links)
• (Q5858823) (← links)
• An efficient logarithmic barrier method without line search for convex quadratic programming (Q5882851) (← links)
• \(\Gamma\)-robust optimization of project scheduling problems (Q6065662) (← links)
• Measures of conflict, basic axioms and their application to the clusterization of a body of evidence (Q6079443) (← links)
• Some Strongly Polynomially Solvable Convex Quadratic Programs with Bounded Variables (Q6161304) (← links)
• Decentralized iterative learning control for constrained collaborative tracking (Q6190201) (← links)
• Quasi-orthogonalization for alternating non-negative tensor factorization (Q6572627) (← links)
• Optimal phase-selective entrainment of electrochemical oscillators with different phase response curves (Q6592614) (← links)
• A Unified Nonparametric Fiducial Approach to Interval-Censored Data (Q6631721) (← links)
• New generalized derivatives for solving variational inequalities using the nonsmooth Newton methods (Q6655811) (← links)