Inexact interior-point method
From MaRDI portal
Recommendations
Cites work
- A QMR-based interior-point algorithm for solving linear programs
- A Superlinear Infeasible-Interior-Point Algorithm for Monotone Complementarity Problems
- An interior point potential reduction method for constrained equations
- Global convergence in infeasible-interior-point algorithms
- Global Linear and Local Quadratic Convergence of a Long-Step Adaptive-Mode Interior Point Method for Some Monotone Variational Inequality Problems
- Globally Convergent Inexact Newton Methods
- scientific article; zbMATH DE number 1444279 (Why is no real title available?)
- Inexact Newton Methods
- Interior-point methods for nonlinear complementarity problems
- On the formulation and theory of the Newton interior-point method for nonlinear programming
Cited in
(49)- Convergence analysis of the inexact infeasible interior-point method for linear optimization
- Computing approximate solutions for convex conic systems of constraints
- Parallel interior-point method for linear and quadratic programs with special structure
- Fast convergence of an inexact interior point method for horizontal complementarity problems
- Stability and accuracy of inexact interior point methods for convex quadratic programming
- Infeasible interior-point algorithms based on sampling average approximations for a class of stochastic complementarity problems and their applications
- An interior point potential reduction method for constrained equations
- Global convergence enhancement of classical linesearch interior point methods for MCPs
- On the Newton interior-point method for nonlinear programming problems
- Approximate solution of system of equations arising in interior-point methods for bound-constrained optimization
- Semismooth and smoothing Newton methods for nonlinear systems with complementarity constraints: adaptivity and inexact resolution
- An improved penalty algorithm using model order reduction for MIPDECO problems with partial observations
- Improved penalty algorithm for mixed integer PDE constrained optimization problems
- Accelerated sampling Kaczmarz Motzkin algorithm for the linear feasibility problem
- On mutual impact of numerical linear algebra and large-scale optimization with focus on interior point methods
- On the update of constraint preconditioners for regularized KKT systems
- A comparison of reduced and unreduced KKT systems arising from interior point methods
- Solution of systems of equalities and inequalities by the method of interior points
- Stopping criteria for inner iterations in inexact potential reduction methods: a computational study
- scientific article; zbMATH DE number 1617956 (Why is no real title available?)
- Updating constraint preconditioners for KKT systems in quadratic programming via low-rank corrections
- Constrained optimization with low-rank tensors and applications to parametric problems with PDEs
- Spectral estimates for unreduced symmetric KKT systems arising from Interior Point methods
- Crash start of interior point methods
- A domain decomposition approach to solve dynamic optimal power flow problems in parallel
- Randomized iterative methods for linear systems
- Inexact FETI-DP methods
- scientific article; zbMATH DE number 1341930 (Why is no real title available?)
- Matrix-free interior point method
- Interior point methods 25 years later
- An inexact interior point method for monotone NCP
- scientific article; zbMATH DE number 1746424 (Why is no real title available?)
- An Infeasible Interior-Point Method with Nonmonotonic Complementarity Gaps
- scientific article; zbMATH DE number 1424202 (Why is no real title available?)
- Sparse approximations with interior point methods
- Efficient Preconditioners for Interior Point Methods via a New Schur Complement-Based Strategy
- A review of termination rules of an inexact primal-dual interior point method for linear programming problems
- A nonmonotone inexact Newton method
- A New Stopping Criterion for Krylov Solvers Applied in Interior Point Methods
- An Implicit Staggered Hybrid Finite Volume/Finite Element Solver for the Incompressible Navier-Stokes Equations
- A structured modified Newton approach for solving systems of nonlinear equations arising in interior-point methods for quadratic programming
- An algorithm for solution of the Sylvester s‐conjugate linear equation for the commutative elliptic octonions
- Efficient preconditioners for solving dynamical optimal transport via interior point methods
- Efficient use of quantum linear system algorithms in inexact infeasible IPMs for linear optimization
- Inexact log-domain interior-point methods for quadratic programming
- Interior point methods in the year 2025
- An inexact feasible interior point method for linear optimization with high adaptability to quantum computers
- Local path-following property of inexact interior methods in nonlinear programming
- A regularized interior point method for sparse optimal transport on graphs
This page was built for publication: Inexact interior-point method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1384053)
