Pages that link to "Item:Q761967"

The following pages link to A new polynomial-time algorithm for linear programming (Q761967):

Displaying 50 items.

• OSQP: An Operator Splitting Solver for Quadratic Programs (Q78613) (← links)
• Randomized interior point methods for sampling and optimization (Q259600) (← links)
• Generation of interior points and polyhedral representations of cones in \(\mathbb R^N\) cut by \(M\) planes sharing a common point (Q261538) (← links)
• An improved full-Newton step \(O(n)\) infeasible interior-point method for horizontal linear complementarity problem (Q261844) (← links)
• Deciding probabilistic automata weak bisimulation: theory and practice (Q282105) (← links)
• Fundamentals of cone regression (Q289730) (← links)
• A path-following full Newton-step infeasible interior-point algorithm for \(P_*(\kappa)\)-HLCPs based on a kernel function (Q290328) (← links)
• A wide neighborhood infeasible-interior-point method with arc-search for linear programming (Q295450) (← links)
• An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term (Q306399) (← links)
• A new primal-dual predictor-corrector interior-point method for linear programming based on a wide neighbourhood (Q306400) (← links)
• Scheduling preemptable jobs on identical processors under varying availability of an additional continuous resource (Q328919) (← links)
• A modified homogeneous potential reduction algorithm for solving the monotone semidefinite linear complementarity problem (Q331977) (← links)
• Binary classification posed as a quadratically constrained quadratic programming and solved using particle swarm optimization (Q332770) (← links)
• Context-content systems of random variables: the contextuality-by-default theory (Q334449) (← links)
• Using the primal-dual interior point algorithm within the branch-price-and-cut method (Q336429) (← links)
• A polynomial interior-point algorithm for monotone linear complementarity problems (Q353166) (← links)
• Formulating and solving a multi-mode resource-collaboration and constrained scheduling problem (MRCCSP) (Q363579) (← links)
• Interior point method for solving fuzzy number linear programming problems using linear ranking function (Q364535) (← links)
• A polynomial arc-search interior-point algorithm for linear programming (Q378268) (← links)
• A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming (Q378283) (← links)
• A 99 line code for discretized Michell truss optimization written in Mathematica (Q381558) (← links)
• Recent progress on the combinatorial diameter of polytopes and simplicial complexes (Q384506) (← links)
• A recipe for finding good solutions to MINLPs (Q384810) (← links)
• A second order Mehrotra-type predictor-corrector algorithm for semidefinite optimization (Q394386) (← links)
• A powerful force-based approach for the limit analysis of three-dimensional frames (Q398030) (← links)
• A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems (Q398651) (← links)
• An iterative rounding 2-approximation algorithm for the \(k\)-partial vertex cover problem (Q403490) (← links)
• An improved predictor-corrector interior-point algorithm for linear complementarity problems with \(O(\sqrt{n}L)\)-iteration complexity (Q410785) (← links)
• Boolean functions with a simple certificate for CNF complexity (Q412324) (← links)
• Computation of channel capacity based on self-concordant functions (Q415822) (← links)
• Gradient-type methods: a unified perspective in computer science and numerical analysis (Q420252) (← links)
• Time-cost trade-off analysis of project networks in fuzzy environments (Q421542) (← links)
• A polynomial arc-search interior-point algorithm for convex quadratic programming (Q421610) (← links)
• Selectivity in probabilistic causality: where psychology runs into quantum physics (Q423115) (← links)
• An adaptive-step primal-dual interior point algorithm for linear optimization (Q425813) (← links)
• Hopfield neural networks in large-scale linear optimization problems (Q428100) (← links)
• Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term (Q432785) (← links)
• Regularization techniques in interior point methods (Q432801) (← links)
• Adaptive constraint reduction for convex quadratic programming (Q434155) (← links)
• An interior-exterior approach for convex quadratic programming (Q436003) (← links)
• Comments on ``Design and performance evaluation of load distribution strategies for multiple loads on heterogeneous linear daisy chain networks'' (Q436840) (← links)
• Geometric complexity theory. III: On deciding nonvanishing of a Littlewood-Richardson coefficient (Q438742) (← links)
• Interior point methods 25 years later (Q439546) (← links)
• A counterexample to the Hirsch conjecture (Q447933) (← links)
• A predictor-corrector algorithm with multiple corrections for convex quadratic programming (Q453603) (← links)
• Artificial-free simplex algorithm based on the non-acute constraint relaxation (Q470802) (← links)
• Criticality for multicommodity flows (Q473104) (← links)
• Prune-and-search with limited workspace (Q473192) (← links)
• A Petri net based approach for multi-robot path planning (Q481351) (← links)
• A study of the dual affine scaling continuous trajectories for linear programming (Q481775) (← links)