The following pages link to Ping-Qi Pan (Q587149):
Displayed 50 items.
- Item:Q587149 (redirect page) (← links)
- Criss-cross algorithm based on the most-obtuse-angle rule and deficient basis (Q668136) (← links)
- An efficient algorithm for the Lagrangean dual of nonlinear knapsack problems with additional nested constraints (Q675985) (← links)
- An outer approximation method for minimizing the product of several convex functions on a convex set (Q686993) (← links)
- Practical finite pivoting rules for the simplex method (Q751498) (← links)
- A combined homotopy interior point method for the linear complementarity problem (Q849782) (← links)
- Feasible region contraction interior point algorithm (Q858800) (← links)
- An efficient approach to updating simplex multipliers in the simplex algorithm (Q927163) (← links)
- Efficient nested pricing in the simplex algorithm (Q943787) (← links)
- Item:Q587149 (redirect page) (← links)
- A Z-simplex algorithm with partial updates (Q1097835) (← links)
- On the choice of the pivot columns of the simplex-method: Gradient criteria (Q1097836) (← links)
- A fully polynomial time projective method (Q1104857) (← links)
- An algorithm for decomposition coordination of large scale convex programming problems (Q1109681) (← links)
- On the convexity of the multiplicative version of Karmarkar's potential function (Q1111466) (← links)
- A projective simplex method for linear programming (Q1124875) (← links)
- A dual projective simplex method for linear programming (Q1129474) (← links)
- Item:Q587149 (redirect page) (← links)
- LP-form inclusion functions for global optimization (Q1174536) (← links)
- Multidimensional bisection applied to global optimisation (Q1174537) (← links)
- Method for minimizing a convex-concave function over a convex set (Q1176848) (← links)
- The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study (Q1278948) (← links)
- Balance constraints reduction of large-scale linear programming problems (Q1309865) (← links)
- A primal-dual infeasible-interior-point algorithm for linear programming (Q1315419) (← links)
- A modified predictor-corrector method for linear programming (Q1318279) (← links)
- Convergence of diagonally stationary sequences in convex optimization (Q1332534) (← links)
- Bounds on characteristics of algorithms to find the global minimum of a function in an \(n\)-dimensional parallelepiped with prespecified accuracy (Q1364062) (← links)
- A global convergence theory for an active-trust-region algorithm for solving the general nonlinear programing problem. (Q1398662) (← links)
- Local tuning and partition strategies for diagonal GO methods (Q1402152) (← links)
- Very low-thrust trajectory optimization using a direct SQP method (Q1578840) (← links)
- A stable elemental decomposition for dynamic process optimization (Q1578842) (← links)
- A new measure of irregularity of distribution and quasi-Monte Carlo methods for global optimization (Q1609128) (← links)
- A phase-1 approach for the generalized simplex algorithm (Q1612514) (← links)
- A new class of preconditioners for large-scale linear systems from interior point methods for linear programming (Q1765884) (← links)
- A dual projective pivot algorithm for linear programming (Q1771222) (← links)
- Numerical experiments with one-dimensional adaptive cubic algorithm (Q1802495) (← links)
- Iterative aggregation and decomposition in block-separable extremum problems (Q1802611) (← links)
- A basis-defiency-allowing variation of the simplex method for linear programming (Q1806578) (← links)
- Projection and discretization methods in stochastic programming (Q1893962) (← links)
- A note on the equivalence of a class of factorized Broyden families for nonlinear least squares problems (Q1965284) (← links)
- A projective simplex algorithm using LU decomposition (Q1975340) (← links)
- A variant of the dual face algorithm using Gauss-Jordan elimination for linear programming (Q2014048) (← links)
- Global optimization in arcwise connected metric spaces (Q2266670) (← links)
- Sensitivity analysis of the additive model in data envelopment analysis (Q2277120) (← links)
- A linear-time algorithm for solving continuous maximin knapsack problems (Q2277359) (← links)
- A largest-distance pivot rule for the simplex algorithm (Q2463487) (← links)
- A primal deficient-basis simplex algorithm for linear programming (Q2479158) (← links)
- An affine-scaling pivot algorithm for linear programming (Q2841137) (← links)
- Linear Programming Computation (Q2851339) (← links)
- (Q2993676) (← links)