Back to Results
First PageMeta Content
Numerical analysis / Linear complementarity problem / Mathematical optimization / Galerkin method / Projection / Lipschitz continuity / Mathematics / Mathematical analysis / Linear algebra


A projection algorithm for strictly monotone linear complementarity problems.∗ Erik Zawadzki Department of Computer Science Carnegie Mellon University
Add to Reading List

Document Date: 2013-12-08 21:36:30

Open Document

File Size: 206,42 KB

Share Result on Facebook

Company

Cambridge University Press / /

/

Facility

Computer Science Carnegie Mellon University / Andr´e Platzer Computer Science Department Carnegie Mellon University / Geoffrey J. Gordon Machine Learning Department Carnegie Mellon University / /

IndustryTerm

point algorithms / interior-point algorithms / approximate solution / projection algorithm / above projection algorithm / basic projective fixed point algorithm / above algorithm / /

Organization

Army Research Office / Lab. for Information / Cambridge University / MIT / problems.∗ Erik Zawadzki Department of Computer Science Carnegie Mellon University Pittsburgh / Geoffrey J. Gordon Machine Learning Department Carnegie Mellon University Pittsburgh / Andr´e Platzer Computer Science Department Carnegie Mellon University Pittsburgh / /

Person

Geoffrey J. Gordon / Francisco Facchinei / Richard Bellman / Shi Pang / Dimitri P Bertsekas / Erik Zawadzki / /

/

Position

author / /

Product

Pentax K-x Digital Camera / /

ProvinceOrState

Pennsylvania / /

PublishedMedium

Lecture Notes in Computer Science / /

Technology

above algorithm / basic projective fixed point algorithm / projection algorithm / interior-point algorithms / Galerkin LCPs The projection algorithm / machine learning / simulation / interior point algorithms / above projection algorithm / /

SocialTag