z-logo
open-access-imgOpen Access
An infeasible interior point methods for convex quadratic problems
Author(s) -
Hayet Roumili,
Nawel Boudjellal
Publication year - 2018
Publication title -
journal of numerical analysis and approximation theory
Language(s) - English
Resource type - Journals
eISSN - 2501-059X
pISSN - 2457-6794
DOI - 10.33993/jnaat472-1147
Subject(s) - interior point method , linear complementarity problem , measure (data warehouse) , mathematics , tracing , regular polygon , mathematical optimization , quadratic equation , path (computing) , point (geometry) , algorithm , computer science , nonlinear system , geometry , physics , quantum mechanics , database , programming language , operating system

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom