Pages that link to "Item:Q4016916"

The following pages link to Path-Following Methods for Linear Programming (Q4016916):

Displaying 50 items.

• An \(\varepsilon\)-sensitivity analysis in the primal-dual interior point method (Q1610185) (← links)
• The challenges of estimating the impact of distributed energy resources flexibility on the TSO/DSO boundary node operating points (Q1652690) (← links)
• A noninterior path following algorithm for solving a class of multiobjective programming problems (Q1719236) (← links)
• Examples of ill-behaved central paths in convex optimization (Q1777216) (← links)
• An interior point potential reduction method for constrained equations (Q1814789) (← links)
• Multiple centrality corrections in a primal-dual method for linear programming (Q1816400) (← links)
• On the construction of strong complementarity slackness solutions for DEA linear programming problems using a primal-dual interior-point method (Q1816897) (← links)
• Analytic centers and repelling inequalities (Q1848382) (← links)
• The convergence of an interior-point method using modified search directions in final iterations (Q1886472) (← links)
• On controlling the parameter in the logarithmic barrier term for convex programming problems (Q1893461) (← links)
• Primal-dual target-following algorithms for linear programming (Q1915912) (← links)
• A lower bound on the number of iterations of long-step primal-dual linear programming algorithms (Q1915913) (← links)
• The Newton modified barrier method for QP problems (Q1915923) (← links)
• New complexity results for the Iri-Imai method (Q1915925) (← links)
• New infeasible interior-point algorithm based on monomial method (Q1919774) (← links)
• A cutting plane method from analytic centers for stochastic programming (Q1922690) (← links)
• A primal-dual potential reduction method for problems involving matrix inequalities (Q1922696) (← links)
• An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities (Q1924060) (← links)
• Primal-dual methods for linear programming (Q1924065) (← links)
• Linear programming, complexity theory and elementary functional analysis (Q1924066) (← links)
• Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming (Q2162530) (← links)
• On the iterative solution of KKT systems in potential reduction software for large-scale quadratic problems (Q2457946) (← links)
• Dual versus primal-dual interior-point methods for linear and conic programming (Q2467157) (← links)
• Generation of degenerate linear programming problems (Q2483038) (← links)
• Improved complexity results on solving real-number linear feasibility problems (Q2490340) (← links)
• A Frisch-Newton algorithm for sparse quantile regression (Q2508013) (← links)
• Piecewise linear regularized solution paths (Q2642739) (← links)
• Path-following barrier and penalty methods for linearly constrained problems (Q2709451) (← links)
• Affine scaling with degenerate linear programming problems (Q2743664) (← links)
• Interior hybrid proximal extragradient methods for the linear monotone complementarity problem (Q2808328) (← links)
• Complexity analysis of interior point methods for linear programming based on a parameterized kernel function (Q2954362) (← links)
• A PRIMAL-DUAL INTERIOR-POINT ALGORITHM BASED ON A NEW KERNEL FUNCTION (Q2996870) (← links)
• A class of polynomial volumetric barrier decomposition algorithms for stochastic semidefinite programming (Q3015050) (← links)
• Global convergence analysis of the aggregate constraint homotopy method for nonlinear programming problems with both inequality and equality constraints (Q3177632) (← links)
• An analytic center cutting plane algorithm for finding equilibrium points (Q3430945) (← links)
• Basic ANM algorithms for path following problems (Q3433183) (← links)
• Strict quasi-concavity and the differential barrier property of gauges in linear programming (Q3453425) (← links)
• Rescaled proximal methods for linearly constrained convex problems (Q3515390) (← links)
• Generic Primal-dual Interior Point Methods Based on a New Kernel Function (Q3539807) (← links)
• A note on the convergence of an inertial version of a diagonal hybrid projection-point algorithm (Q3577847) (← links)
• (Q4279636) (← links)
• (Q4347843) (← links)
• (Q4363767) (← links)
• Equivalent formulae for the supremum and stability of weighted pseudoinverses (Q4372655) (← links)
• A primal‐dual interior-point method for linear optimization based on a new proximity function (Q4405935) (← links)
• Implementation of interior point methods for mixed semidefinite and second order cone optimization problems (Q4405940) (← links)
• A circular cone relaxation primal interior point algorithm for LP (Q4467177) (← links)
• Perturbed path following predictor-corrector interior point algorithms (Q4504781) (← links)
• A unified complexity analysis of interior point methods for semidefinite problems based on trigonometric kernel functions (Q4639122) (← links)
• Path-Following Method to Determine the Field of Values of a Matrix with High Accuracy (Q4644412) (← links)