Pages that link to "Item:Q5701578"

The following pages link to Interior Point Methods for Linear Optimization (Q5701578):

Displaying 46 items.

• An analogue of the Klee-Walkup result for sonnevend's curvature of the central path (Q289062) (← links)
• A wide neighborhood infeasible-interior-point method with arc-search for linear programming (Q295450) (← links)
• Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes (Q384507) (← links)
• A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones (Q415402) (← links)
• Full Nesterov-Todd step infeasible interior-point method for symmetric optimization (Q635148) (← links)
• A full-Newton step infeasible interior-point algorithm for \(P_\ast (\kappa)\) linear complementarity problem (Q890633) (← links)
• Identifying the optimal partition in convex quadratic programming (Q924889) (← links)
• Polytopes and arrangements: diameter and curvature (Q935228) (← links)
• Convergence of the homotopy path for a full-Newton step infeasible interior-point method (Q969524) (← links)
• A redundant Klee-Minty construction with all the redundant constraints touching the feasible region (Q1003486) (← links)
• A continuous \(d\)-step conjecture for polytopes (Q1017920) (← links)
• A wide neighborhood interior-point algorithm with arc-search for \(P_{\ast}(\kappa)\) linear complementarity problem (Q1633334) (← links)
• Maximal solutions of sparse analysis regularization (Q1730389) (← links)
• A generalized direction in interior point method for monotone linear complementarity problems (Q1733321) (← links)
• A novel unified approach to invariance conditions for a linear dynamical system (Q1735111) (← links)
• A new second-order corrector interior-point algorithm for semidefinite programming (Q1935927) (← links)
• On complexity of a new Mehrotra-type interior point algorithm for \(P_\ast(\kappa )\) linear complementarity problems (Q2067705) (← links)
• A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints (Q2147941) (← links)
• A wide neighborhood predictor-infeasible corrector interior-point algorithm for linear optimization (Q2228421) (← links)
• On the sensitivity of the optimal partition for parametric second-order conic optimization (Q2230950) (← links)
• A still simpler way of introducing interior-point method for linear programming (Q2374256) (← links)
• A finite termination Mehrotra-type predictor-corrector algorithm (Q2383922) (← links)
• Bounds on the complexity of halfspace intersections when the bounded faces have small dimension (Q2391831) (← links)
• Interior-point solver for convex separable block-angular problems (Q2811483) (← links)
• An exact method for balancing efficiency and equity in the liver allocation hierarchy (Q2815444) (← links)
• Reconstructing gas distribution maps via an adaptive sparse regularization algorithm (Q2831847) (← links)
• Research Article: On Extending Primal-Dual Interior-Point Method for Linear Optimization to Convex Quadratic Symmetric Cone Optimization (Q2841915) (← links)
• On computational complexity of construction of \(c\)-optimal linear regression models over finite experimental domains (Q2913226) (← links)
• Invariance Conditions for Nonlinear Dynamical Systems (Q2957709) (← links)
• Newton-type interior-point methods for solving generalized complementarity problems in polyhedral cones (Q3112509) (← links)
• Multiobjective Optimization via Parametric Optimization: Models, Algorithms, and Applications (Q3454974) (← links)
• Mehrotra-type predictor-corrector algorithm revisited (Q3539794) (← links)
• Central Path Curvature and Iteration-Complexity for Redundant Klee—Minty Cubes (Q3565464) (← links)
• Interior Point Methods for Nonlinear Optimization (Q3569506) (← links)
• (Q4562761) (← links)
• New complexity analysis of a full Nesterov–Todd step interior-point method for semidefinite optimization (Q4595149) (← links)
• Primal-Dual Algorithms for P ∗(κ) Linear Complementarity Problems Based on Kernel-Function with Trigonometric Barrier Term (Q4596180) (← links)
• A New Predictor-corrector Infeasible Interior-point Algorithm for Linear Optimization in aWide Neighborhood (Q4988920) (← links)
• (Q5025086) (← links)
• (Q5091983) (← links)
• An extension for identifying search directions for interior-point methods in linear optimization (Q5213020) (← links)
• A Single-Phase, Proximal Path-Following Framework (Q5219702) (← links)
• Diameter and Curvature: Intriguing Analogies (Q5301011) (← links)
• Spline regression models for complex multi-modal regulatory networks (Q5746713) (← links)
• A full-Newton step infeasible interior point algorithm and its parameters analysis (Q6536945) (← links)
• Efficient use of quantum linear system algorithms in inexact infeasible IPMs for linear optimization (Q6596332) (← links)