Skip to content
VuFind
Advanced
  • A SMOOTHING NEWTON ALGORITHM F...
  • Cite this
  • Print
  • Export Record
    • Export to RefWorks
    • Export to EndNoteWeb
    • Export to EndNote
A SMOOTHING NEWTON ALGORITHM FOR MATHEMATICAL PROGRAMS WITH COMPLEMENTARITY CONSTRAINTS
QR Code

A SMOOTHING NEWTON ALGORITHM FOR MATHEMATICAL PROGRAMS WITH COMPLEMENTARITY CONSTRAINTS

Bibliographic Details
Main Authors: Huang, Z., Sun, Jie
Format: Journal Article
Published: American Institute of Mathematical Sciences 2005
Online Access:http://hdl.handle.net/20.500.11937/28384
  • Holdings
  • Description
  • Similar Items
  • Staff View

Internet

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

Similar Items

  • A regularized smoothing Newton method for symmetric cone complementarity problems
    by: Kong, L., et al.
    Published: (2008)
  • A robust SQP method for mathematical programs with linear complementarity constraints
    by: Liu, X., et al.
    Published: (2006)
  • A smoothing Newton algorithm for the LCP with a sufficient matrix that terminates finitely at a maximally complementary solution
    by: Sun, Jie, et al.
    Published: (2006)
  • A smoothing projected Newton-type algorithm for semi-infinite programming
    by: Qi, L., et al.
    Published: (2009)
  • A Smoothing Approach for Semi-infinite Programming with Projected Newton-type Algorithm
    by: Feng, Zhi, et al.
    Published: (2007)

Search Options

  • Advanced Search

Find More

  • Browse the Catalog

Need Help?

  • Search Tips