New complexity analysis of a full-Newton step feasible interior-point algorithm for P_()-LCP

DOI10.1007/S11590-014-0800-4MaRDI QIDQ497434zbMATH OpenOpenAlexFDO

Authors Yong-Cai Geng, Sumit K. Garg

Publication date 24 September 2015

Published in Optimization Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11590-014-0800-4

zbMATH Keywords

interior-point methodslinear complementarity problempolynomial complexityfull-Newton step\(P_\ast(\kappa)\)-matrix

Mathematics Subject Classification ID

Interior-point methods (90C51) Abstract computational complexity for mathematical programming problems (90C60) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems
• A full-Newton step infeasible interior-point algorithm for P_ () linear complementarity problem
• scientific article; zbMATH DE number 6913928
• A full-Newton step infeasible interior-point algorithm for LCPs based on a kernel function
• A new full-Newton infeasible interior-point algorithm for \(P_*(\kappa)\) linear complementarity problems

Cites work

• A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
• A class of large-update and small-update primal-dual interior-point algorithms for linear optimization
• A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems
• A full-Newton step interior-point algorithm based on modified Newton direction
• A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems
• A polynomial interior-point algorithm for monotone linear complementarity problems
• A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem
• A unified approach to interior point algorithms for linear complementarity problems: A summary
• An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
• An infeasible primal-dual interior point algorithm for linear programs based on logarithmic equivalent transformation
• Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems
• Engineering and Economic Applications of Complementarity Problems
• Interior point methods for sufficient horizontal LCP in a wide neighborhood of the central path with best known iteration complexity
• New interior point algorithms in linear programming
• Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems
• Polynomial interior-point algorithms for P_*( ) horizontal linear complementarity problem
• Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points
• Unified analysis of kernel-based interior-point methods for \(P_*(\kappa)\)-linear complementarity problems

Cited in

(11)

• A path-following full Newton-step infeasible interior-point algorithm for \(P_*(\kappa)\)-HLCPs based on a kernel function
• scientific article; zbMATH DE number 6913928 (Why is no real title available?)
• A generalized direction in interior point method for monotone linear complementarity problems
• A new full-NT step interior-point method for circular cone optimization
• Complexity analysis and numerical implementation of a full-Newton step interior-point algorithm for LCCO
• A new search direction for full-Newton step infeasible interior-point method in linear optimization
• A new full-Newton step interior-point method for \(P_*(\kappa)\)-LCP based on a positive-asymptotic kernel function
• A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems
• A second-order corrector wide neighborhood infeasible interior-point method for linear optimization based on a specific kernel function
• Complexity analysis of a weighted-full-Newton step interior-point algorithm for \(P_*(\kappa)\)-LCP
• An interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new trigonometric kernel function with a double barrier term

This page was built for publication: New complexity analysis of a full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-LCP

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q497434)