Pages that link to "Item:Q4294729"
From MaRDI portal
The following pages link to An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm (Q4294729):
Displaying 50 items.
- Active-set prediction for interior point methods using controlled perturbations (Q263153) (← links)
- A fixed point iterative approach to integer programming and its distributed computation (Q288180) (← links)
- Conic optimization via operator splitting and homogeneous self-dual embedding (Q301735) (← links)
- The practical behavior of the homogeneous self-dual formulations in interior point methods (Q302143) (← links)
- A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for linear programming over symmetric cones (Q306357) (← links)
- Crash start of interior point methods (Q323526) (← links)
- A modified homogeneous potential reduction algorithm for solving the monotone semidefinite linear complementarity problem (Q331977) (← links)
- An alternating direction method for second-order conic programming (Q336362) (← links)
- First-order algorithm with \({\mathcal{O}(\ln(1/\epsilon))}\) convergence for \({\epsilon}\)-equilibrium in two-person zero-sum games (Q431003) (← links)
- A predictor-corrector algorithm with multiple corrections for convex quadratic programming (Q453603) (← links)
- A homogeneous smoothing-type algorithm for symmetric cone linear programs (Q477482) (← links)
- Corrector-predictor methods for sufficient linear complementarity problems (Q538303) (← links)
- An \(O(\sqrt nL)\) iteration primal-dual second-order corrector algorithm for linear programming (Q644523) (← links)
- New method for determining search directions for interior-point algorithms in linear optimization (Q723503) (← links)
- A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization (Q735073) (← links)
- On two measures of problem instance complexity and their correlation with the performance of SeDuMi on second-order cone problems (Q853555) (← links)
- A primal-dual symmetric relaxation for homogeneous conic systems (Q883335) (← links)
- Average case complexity results for a centering algorithm for linear programming problems under Gaussian distributions (Q1002052) (← links)
- Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming (Q1290596) (← links)
- Global convergence in infeasible-interior-point algorithms (Q1334952) (← links)
- Potential-reduction methods in mathematical programming (Q1361104) (← links)
- Improved complexity using higher-order correctors for primal-dual Dikin affine scaling (Q1361107) (← links)
- On homogeneous and self-dual algorithms for LCP (Q1361111) (← links)
- Initialization in semidefinite programming via a self-dual skew-symmetric embedding (Q1362529) (← links)
- Interior-point methods (Q1593831) (← links)
- Complexity analysis of a full-{N}ewton step interior-point method for linear optimization (Q1677554) (← links)
- A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for symmetric optimization with the arc-search strategy (Q1681807) (← links)
- A homogeneous model for monotone mixed horizontal linear complementarity problems (Q1734775) (← links)
- Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone (Q1785193) (← links)
- Efficient semidefinite branch-and-cut for MAP-MRF inference (Q1800052) (← links)
- A generalized homogeneous and self-dual algorithm for linear programming (Q1904760) (← links)
- A unified approach to infeasible-interior-point algorithms via geometrical linear complementarity problems (Q1913863) (← links)
- An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution (Q1915904) (← links)
- An infeasible-interior-point algorithm using projections onto a convex set (Q1915905) (← links)
- An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence (Q1915906) (← links)
- A path-following interior-point algorithm for linear and quadratic problems (Q1915907) (← links)
- A simplified homogeneous and self-dual linear programming algorithm and its implementation (Q1915910) (← links)
- Primal-dual target-following algorithms for linear programming (Q1915912) (← links)
- Warmstarting the homogeneous and self-dual interior point method for linear and conic quadratic problems (Q1947198) (← links)
- Numerical algebraic geometry and semidefinite programming (Q1979983) (← links)
- Identification of optimal feedback control rules from micro-quadrotor and insect flight trajectories (Q1990528) (← links)
- Conic programming: infeasibility certificates and projective geometry (Q1996078) (← links)
- A survey on conic relaxations of optimal power flow problem (Q2023908) (← links)
- Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion (Q2039245) (← links)
- An infeasible-start framework for convex quadratic optimization, with application to constraint-reduced interior-point and other methods (Q2089775) (← links)
- Status determination by interior-point methods for convex optimization problems in domain-driven form (Q2149574) (← links)
- A corrector-predictor interior-point method with new search direction for linear optimization (Q2201317) (← links)
- On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods (Q2227537) (← links)
- A new wide neighborhood primal-dual second-order corrector algorithm for linear optimization (Q2228364) (← links)
- A wide neighborhood predictor-infeasible corrector interior-point algorithm for linear optimization (Q2228421) (← links)
