Complexity analysis of primal-dual algorithms for the semidefinite linear complementarity problem
Copyright policy )Complexity analysis of primal-dual algorithms for the semidefinite linear complementarity problem
In this paper a primal-dual path-following interior-point algorithm for the monotone semidefinite linear complementarity problem is presented. The algorithm is based on Nesterov-Todd search directions and on a suitable proximity for tracing approximately the central-path. We provide an unified analysis for both long and small-update primal-dual algorithms. Finally, the iteration bounds for these algorithms are obtained.
- University Ferhat Abbas of Setif Algeria
- University of Batna Algeria
polynomial complexity, Complementarity (molecular biology), Quadratically constrained quadratic program, Computational Mechanics, Geometry, Quadratic programming, Quantum mechanics, Semidefinite embedding, long and small-update primal-dual algorithms, Engineering, Interior-Point Methods, Tracing, QA1-939, FOS: Mathematics, Matrix Completion, Interior point method, Genetics, Orthogonal Matching Pursuit, Semidefinite programming, Biology, Matrix Algorithms and Iterative Methods, Numerical Analysis, interior point methods, Numerical Optimization Techniques, Semidefinite Programming, Dual (grammatical number), Physics, Mathematical optimization, Theory and Applications of Compressed Sensing, Computer science, Algorithm, Operating system, Computational Theory and Mathematics, Literature, FOS: Biological sciences, Physical Sciences, Computer Science, Linear complementarity problem, Nonlinear system, semidefinite linear complementarity problems, Monotone polygon, Mathematics, Art, Mixed-Integer Nonlinear Programs
polynomial complexity, Complementarity (molecular biology), Quadratically constrained quadratic program, Computational Mechanics, Geometry, Quadratic programming, Quantum mechanics, Semidefinite embedding, long and small-update primal-dual algorithms, Engineering, Interior-Point Methods, Tracing, QA1-939, FOS: Mathematics, Matrix Completion, Interior point method, Genetics, Orthogonal Matching Pursuit, Semidefinite programming, Biology, Matrix Algorithms and Iterative Methods, Numerical Analysis, interior point methods, Numerical Optimization Techniques, Semidefinite Programming, Dual (grammatical number), Physics, Mathematical optimization, Theory and Applications of Compressed Sensing, Computer science, Algorithm, Operating system, Computational Theory and Mathematics, Literature, FOS: Biological sciences, Physical Sciences, Computer Science, Linear complementarity problem, Nonlinear system, semidefinite linear complementarity problems, Monotone polygon, Mathematics, Art, Mixed-Integer Nonlinear Programs
citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).4 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!