Kernel function based interior-point methods for horizontal linear complementarity problems
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1029-242X
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
Kernel function based interior-point methods for horizontal linear complementarity problems ; volume:2013 ; number:1 ; day:29 ; month:4 ; year:2013 ; pages:1-15 ; date:12.2013
Journal of inequalities and applications ; 2013, Heft 1 (29.4.2013), 1-15, 12.2013
- Creator
-
Lee, Yong-Hoon
Cho, You-Young
Cho, Gyeong-Mi
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1186/1029-242X-2013-215
- URN
-
urn:nbn:de:101:1-2021080821373393648551
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:54 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Lee, Yong-Hoon
- Cho, You-Young
- Cho, Gyeong-Mi
- SpringerLink (Online service)
Other Objects (12)
A unified approach to interior point algorithms for linear complementarity problems
Interior-point algorithm for symmetric cone horizontal linear complementarity problems based on a new class of algebraically equivalent transformations
A generic interior-point framework for nonsmooth and complementarity constrained nonlinear optimization
A New Ai–Zhang Type Interior Point Algorithm for Sufficient Linear Complementarity Problems
A New full-newton step infeasible interior-point method for $$P_*(\kappa )$$ P ∗ ( κ ) -linear Complementarity problem
Kernel-function-based primal-dual interior-point methods for convex quadratic optimization over symmetric cone
On complexity of a new Mehrotra-type interior point algorithm for P∗(κ) $P_*}(\kappa )$ linear complementarity problems
Complementarity
Complementarity
New Predictor–Corrector Algorithm for Symmetric Cone Horizontal Linear Complementarity Problems
Interior point method on semi-definite linear complementarity problems using the Nesterov–Todd (NT) search direction: polynomial complexity and local convergence
Complementarity problems
A unified approach to interior point algorithms for linear complementarity problems
Interior-point algorithm for symmetric cone horizontal linear complementarity problems based on a new class of algebraically equivalent transformations
A generic interior-point framework for nonsmooth and complementarity constrained nonlinear optimization
A New Ai–Zhang Type Interior Point Algorithm for Sufficient Linear Complementarity Problems
A New full-newton step infeasible interior-point method for $$P_*(\kappa )$$ P ∗ ( κ ) -linear Complementarity problem
Kernel-function-based primal-dual interior-point methods for convex quadratic optimization over symmetric cone
On complexity of a new Mehrotra-type interior point algorithm for P∗(κ) $P_*}(\kappa )$ linear complementarity problems
Complementarity
Complementarity
New Predictor–Corrector Algorithm for Symmetric Cone Horizontal Linear Complementarity Problems
Interior point method on semi-definite linear complementarity problems using the Nesterov–Todd (NT) search direction: polynomial complexity and local convergence
Complementarity problems
A unified approach to interior point algorithms for linear complementarity problems
Interior-point algorithm for symmetric cone horizontal linear complementarity problems based on a new class of algebraically equivalent transformations
A generic interior-point framework for nonsmooth and complementarity constrained nonlinear optimization
A New Ai–Zhang Type Interior Point Algorithm for Sufficient Linear Complementarity Problems
A New full-newton step infeasible interior-point method for $$P_*(\kappa )$$ P ∗ ( κ ) -linear Complementarity problem
Kernel-function-based primal-dual interior-point methods for convex quadratic optimization over symmetric cone
On complexity of a new Mehrotra-type interior point algorithm for P∗(κ) $P_*}(\kappa )$ linear complementarity problems
Complementarity
Complementarity
New Predictor–Corrector Algorithm for Symmetric Cone Horizontal Linear Complementarity Problems
Interior point method on semi-definite linear complementarity problems using the Nesterov–Todd (NT) search direction: polynomial complexity and local convergence