On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
From MaRDI portal
Publication:4294753
Recommendations
- Convergence of an Infeasible Interior-Point Algorithm from Arbitrary Positive Starting Points
- scientific article; zbMATH DE number 2195332
- On the Convergence of the Iteration Sequence of Infeasible Path Following Algorithms for Linear Complementarity Problems
- Global convergence in infeasible-interior-point algorithms
Cited in
(only showing first 100 items - show all)- An interior point potential reduction method for constrained equations
- Interior-point methods
- Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning
- An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence
- Generalizations of \(\mathbf P_ 0\)- and \(\mathbf P\)-properties; extended vertical and horizontal linear complementarity problems
- Superlinear and quadratic convergence of some primal - dual interior point methods for constrained optimization
- An improved full-Newton step O(n) infeasible interior-point method for horizontal linear complementarity problem
- Two new predictor-corrector algorithms for second-order cone programming
- A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems
- Large-neighborhood infeasible predictor-corrector algorithm for horizontal linear complementarity problems over Cartesian product of symmetric cones
- Splitting methods for a class of horizontal linear complementarity problems
- A relaxation two-sweep modulus-based matrix splitting iteration method for horizontal linear complementarity problems
- Polynomial interior-point algorithms for P_*( ) horizontal linear complementarity problem
- On the convergence of modulus-based matrix splitting methods for horizontal linear complementarity problems in hydrodynamic lubrication
- A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems
- A new predictor-corrector infeasible interior-point algorithm for linear optimization in a wide neighborhood
- A corrector-predictor interior-point algorithm for \(P_\ast(\kappa)\)-HLCPs over Cartesian product of symmetric cones
- An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming
- A modified and simplified full Nesterov-Todd step \(\mathcal {O}(N)\) infeasible interior-point method for second-order cone optimization
- Infeasible interior-point algorithms based on sampling average approximations for a class of stochastic complementarity problems and their applications
- An adaptive infeasible-interior-point method with the one-norm wide neighborhood for semi-definite programming
- A full-step interior-point algorithm for linear complementarity problem based on a simple function
- A combined homotopy interior point method for the linear complementarity problem
- A preconditioned general modulus-based matrix splitting iteration method for solving horizontal linear complementarity problems
- Modulus-based matrix splitting methods for horizontal linear complementarity problems
- An adaptive infeasible interior-point algorithm with full Nesterov-Todd step for semidefinite optimization
- Projection onto a polyhedron that exploits sparsity
- On the equivalence between some projected and modulus-based splitting methods for linear complementarity problems
- Interior point methods, a decade after Karmarkar—a survey, with application to the smallest eigenvalue problem
- Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
- A full-Newton step infeasible interior-point method for linear optimization based on an exponential kernel function
- Trajectory-following methods for large-scale degenerate convex quadratic programming
- An interior point-proximal method of multipliers for convex quadratic programming
- A wide neighborhood infeasible-interior-point method with arc-search for linear programming
- An infeasible interior-point technique to generate the nondominated set for multiobjective optimization problems
- A generalization of irreducibility and diagonal dominance with applications to horizontal and vertical linear complementarity problems
- Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs
- Newton-type interior-point methods for solving generalized complementarity problems in polyhedral cones
- Convergence analysis of the inexact infeasible interior-point method for linear optimization
- A Mehrotra type predictor-corrector interior-point algorithm for linear programming
- A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for linear programming over symmetric cones
- Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points
- An infeasible-start path-following method for monotone LCPs
- A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization
- An infeasible interior-point algorithm for linear optimization over Cartesian symmetric cones
- A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization
- A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming
- An infeasible-interior-point algorithm using projections onto a convex set
- The convergence of the modulus-based Jacobi (MJ) iteration method for solving horizontal linear complementarity problems
- An iterative method for horizontal tensor complementarity problems
- A primal-dual interior-point method based on a new kernel function for linear complementarity problem
- Sparse approximations with interior point methods
- Primal-dual interior-point methods for domain-driven formulations
- An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution
- Solving real-world linear ordering problems using a primal-dual interior point cutting plane method
- Polynomial convergence of Mehrotra-type prediction-corrector infeasible-IPM for symmetric optimization based on the commutative class directions
- A smoothing Gauss-Newton method for the generalized HLCP
- The nonlinear lopsided PSS-like and HSS-like modulus-based matrix splitting iteration methods for horizontal linear complementarity problem
- An infeasible-interior-point algorithm for linear complementarity problems
- LOQO:an interior point code for quadratic programming
- An investigation of interior-point and block pivoting algorithms for large-scale symmetric monotone linear complementarity problems
- Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs
- On convergence of the modulus-based matrix splitting iteration method for horizontal linear complementarity problems of \(H_+\)-matrices
- A new kind of simple kennel function yielding good iteration bounds for primal-dual interior-point methods
- Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming
- The complexity of self-regular proximity based infeasible IPMs
- Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming
- Status determination by interior-point methods for convex optimization problems in domain-driven form
- A modified full-Newton step infeasible interior-point algorithm for linear optimization
- A modulus-based nonsmooth Newton's method for solving horizontal linear complementarity problems
- A predictor-corrector interior-point algorithm for \(P_\ast (\kappa )\)-horizontal linear complementarity problem
- A numerical study of an infeasible primal-dual path-following algorithm for linear programming
- An affine scaling method with an infeasible starting point: Convergence analysis under nondegeneracy assumption
- An adaptive infeasible interior-point algorithm for linear complementarity problems
- New infeasible interior-point algorithm based on monomial method
- A still simpler way of introducing interior-point method for linear programming
- Convergence of the homotopy path for a full-Newton step infeasible interior-point method
- A full-Newton step feasible interior-point algorithm for monotone horizontal linear complementarity problems
- Improved full-Newton step \(O(nL)\) infeasible interior-point method for linear optimization
- An \(\ell_{2}\)-neighborhood infeasible interior-point algorithm for linear complementarity problems
- The relaxation modulus-based matrix splitting iteration method for horizontal linear complementarity problems
- On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms
- Polynomiality of infeasible-interior-point algorithms for linear programming
- A Mehrotra-type predictor-corrector algorithm with polynomiality and \(Q\)-subquadratic convergence
- A generalized variant of two-sweep modulus-based matrix splitting iteration method for solving horizontal linear complementarity problems
- Superlinear convergence of infeasible-interior-point methods for linear programming
- A full-Newton step infeasible interior-point algorithm based on darvay directions for linear optimization
- An infeasible interior-point method for the \(P_*\)-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step
- Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming
- A new feasible interior-point algorithm with full step for linear optimization based on a simple function
- A primal-dual algorithm for unfolding neutron energy spectrum from multiple activation foils
- Convergence analysis of an infeasible interior point algorithm based on a regularized central path for linear complementarity problems
- On the extended linear complementarity problem
- A second-order corrector infeasible interior-point method for semidefinite optimization based on a wide neighborhood
- A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for symmetric optimization with the arc-search strategy
- A generalized homogeneous and self-dual algorithm for linear programming
- A superquadratic infeasible-interior-point method for linear complementarity problems
- A sparse counterpart of Reichel and Gragg's package QRUP
- A modified infeasible-interior-point algorithm for linear optimization problems
- Simplified infeasible interior-point algorithm for linear optimization based on a simple function
This page was built for publication: On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4294753)
