Skip to content
VuFind
Advanced
  • A robust SQP method for mathem...
  • Cite this
  • Print
  • Export Record
    • Export to RefWorks
    • Export to EndNoteWeb
    • Export to EndNote
A robust SQP method for mathematical programs with linear complementarity constraints
QR Code

A robust SQP method for mathematical programs with linear complementarity constraints

Bibliographic Details
Main Authors: Liu, X., Perakis, G., Sun, Jie
Format: Journal Article
Published: Springer, Van Godewijckstraat 2006
Online Access:http://hdl.handle.net/20.500.11937/33024
  • Holdings
  • Description
  • Similar Items
  • Staff View

Internet

http://hdl.handle.net/20.500.11937/33024

Similar Items

  • A SMOOTHING NEWTON ALGORITHM FOR MATHEMATICAL PROGRAMS WITH COMPLEMENTARITY CONSTRAINTS
    by: Huang, Z., et al.
    Published: (2005)
  • Robust two-stage stochastic linear programs with moment constraints
    by: Gao, S., et al.
    Published: (2014)
  • Generalized stationary points and an interior-point method for mathematical programs with equilibrium constraints
    by: Liu, X., et al.
    Published: (2004)
  • A power penalty method for linear complementarity problems
    by: Wang, Song, et al.
    Published: (2008)
  • A regularized smoothing Newton method for symmetric cone complementarity problems
    by: Kong, L., et al.
    Published: (2008)

Search Options

  • Advanced Search

Find More

  • Browse the Catalog

Need Help?

  • Search Tips