Interior Point Methods for Linear Optimization
From MaRDI portal
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to numerical analysis (65-01) Numerical mathematical programming methods (65K05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Linear programming (90C05) Interior-point methods (90C51)
Recommendations
Cited in
(49)- A redundant Klee-Minty construction with all the redundant constraints touching the feasible region
- A continuous d-step conjecture for polytopes
- A wide neighborhood interior-point algorithm with arc-search for \(P_{\ast}(\kappa)\) linear complementarity problem
- Maximal solutions of sparse analysis regularization
- A generalized direction in interior point method for monotone linear complementarity problems
- A novel unified approach to invariance conditions for a linear dynamical system
- A new second-order corrector interior-point algorithm for semidefinite programming
- On complexity of a new Mehrotra-type interior point algorithm for \(P_\ast(\kappa )\) linear complementarity problems
- A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints
- A wide neighborhood predictor-infeasible corrector interior-point algorithm for linear optimization
- On the sensitivity of the optimal partition for parametric second-order conic optimization
- A still simpler way of introducing interior-point method for linear programming
- A finite termination Mehrotra-type predictor-corrector algorithm
- Bounds on the complexity of halfspace intersections when the bounded faces have small dimension
- Interior-point solver for convex separable block-angular problems
- An exact method for balancing efficiency and equity in the liver allocation hierarchy
- Reconstructing gas distribution maps via an adaptive sparse regularization algorithm
- On extending primal-dual interior-point method for linear optimization to convex quadratic symmetric cone optimization
- An analogue of the Klee-Walkup result for sonnevend's curvature of the central path
- On computational complexity of construction of c-optimal linear regression models over finite experimental domains
- A wide neighborhood infeasible-interior-point method with arc-search for linear programming
- Invariance conditions for nonlinear dynamical systems
- Newton-type interior-point methods for solving generalized complementarity problems in polyhedral cones
- Multiobjective optimization via parametric optimization: models, algorithms, and applications
- Mehrotra-type predictor-corrector algorithm revisited
- Central path curvature and iteration-complexity for redundant Klee-Minty cubes
- Interior Point Methods for Nonlinear Optimization
- Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes
- A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones
- A numerical approach to solve quadratic calculus of variation problems
- New complexity analysis of a full Nesterov-Todd step interior-point method for semidefinite optimization
- Primal-dual algorithms for P_() linear complementarity problems based on kernel-function with trigonometric barrier term
- A new predictor-corrector infeasible interior-point algorithm for linear optimization in a wide neighborhood
- Advances in induced optimal partition invariancy analysis in uni-parametric linear optimization
- A convex analysis view of the barrier problem
- An extension for identifying search directions for interior-point methods in linear optimization
- A single-phase, proximal path-following framework
- Diameter and Curvature: Intriguing Analogies
- Spline regression models for complex multi-modal regulatory networks
- Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
- A full-Newton step infeasible interior point algorithm and its parameters analysis
- Efficient use of quantum linear system algorithms in inexact infeasible IPMs for linear optimization
- Surface movement method for linear programming
- A new parametric kernel function based on p-generalized sigmoid function for the primal-dual interior point method of linear optimization
- An inexact interior-point relaxation method for linear optimization with a spectral preconditioner
- A full-Newton step infeasible interior-point algorithm for P_ () linear complementarity problem
- Identifying the optimal partition in convex quadratic programming
- Polytopes and arrangements: diameter and curvature
- Convergence of the homotopy path for a full-Newton step infeasible interior-point method
This page was built for publication: Interior Point Methods for Linear Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5701578)
