Pages that link to "Item:Q689124"

The following pages link to Convergence behavior of interior-point algorithms (Q689124):

Displaying 46 items.

• A polynomial arc-search interior-point algorithm for convex quadratic programming (Q421610) (← links)
• Quadratic regularizations in an interior-point method for primal block-angular problems (Q652285) (← links)
• On the finite convergence of interior-point algorithms for linear programming (Q687096) (← links)
• A new algorithm for solving convex parametric quadratic programs based on graphical derivatives of solution mappings (Q710681) (← links)
• Characterizing the universal rigidity of generic frameworks (Q741616) (← links)
• Theory of semidefinite programming for sensor network localization (Q868476) (← links)
• Identifying the optimal partition in convex quadratic programming (Q924889) (← links)
• Bi-parametric optimal partition invariancy sensitivity analysis in linear optimization (Q940836) (← links)
• On interior algorithms for linear programming with no regularity assumptions (Q1197904) (← links)
• Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming (Q1290596) (← links)
• On parametric semidefinite programming (Q1294552) (← links)
• Finding an interior point in the optimal face of linear programs (Q1319020) (← links)
• On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP (Q1319022) (← links)
• Constant potential primal-dual algorithms: A framework (Q1340053) (← links)
• Recovering an optimal LP basis from an interior point solution (Q1342078) (← links)
• On homogeneous and self-dual algorithms for LCP (Q1361111) (← links)
• Initialization in semidefinite programming via a self-dual skew-symmetric embedding (Q1362529) (← links)
• A superlinearly convergent wide-neighborhood predictor-corrector interior-point algorithm for linear programming (Q1677164) (← links)
• On self-regular IPMs (with comments and rejoinder) (Q1769946) (← links)
• Stabilization of Mehrotra's primal-dual algorithm and its implementation (Q1771347) (← links)
• On the convergence of primal-dual interior-point methods with wide neighborhoods (Q1804577) (← links)
• On the convergence rate of Newton interior-point methods in the absence of strict complementarity (Q1816402) (← links)
• Analytic centers and repelling inequalities (Q1848382) (← links)
• Predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence (Q1893347) (← links)
• A primal-dual interior-point method for linear programming based on a weighted barrier function (Q1906738) (← links)
• A Mehrotra-type predictor-corrector algorithm with polynomiality and \(Q\)-subquadratic convergence (Q1915908) (← links)
• Identifying an optimal basis in linear programming (Q1915926) (← links)
• Interior-point methods for nonlinear complementarity problems (Q1918290) (← links)
• A general parametric analysis approach and its implication to sensitivity analysis in interior point methods (Q1919814) (← links)
• A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks (Q2029899) (← links)
• Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming (Q2162530) (← links)
• On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods (Q2227537) (← links)
• A relaxed interior point method for low-rank semidefinite programming problems with applications to matrix completion (Q2236545) (← links)
• Necessary and sufficient conditions of solution uniqueness in 1-norm minimization (Q2260650) (← links)
• On the convergence of a predictor-corrector variant algorithm (Q2355008) (← links)
• A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming (Q2368076) (← links)
• Input design for discrimination between classes of LTI models (Q2409415) (← links)
• Dynamic non-diagonal regularization in interior point methods for linear and convex quadratic programming (Q2420822) (← links)
• On the uniqueness of optimal strategies in symmetric matrix games (Q2451671) (← links)
• A smoothing-type algorithm for solving linear complementarity problems with strong convergence properties (Q2480789) (← links)
• On the probabilistic complexity of finding an approximate solution for linear programming (Q2483208) (← links)
• An efficient arc-search interior-point algorithm for convex quadratic programming with box constraints (Q2674577) (← links)
• A quadratically convergent polynomial long-step algorithm for A class of nonlinear monotone complementarity problems^* (Q2709447) (← links)
• A STUDY ON SENSITIVITY ANALYSIS FOR CONVEX QUADRATIC PROGRAMS (Q3421859) (← links)
• Primal-Dual Path-Following Methods and the Trust-Region Updating Strategy for Linear Programming with Noisy Data (Q5090518) (← links)
• A step-truncated method in a wide neighborhood interior-point algorithm for linear programming (Q6110633) (← links)