Skip to content
VuFind
Advanced
  • A non-interior continuation al...
  • Cite this
  • Print
  • Export Record
    • Export to RefWorks
    • Export to EndNoteWeb
    • Export to EndNote
A non-interior continuation algorithm for the P0 or P * LCP with strong global and local convergence properties
QR Code

A non-interior continuation algorithm for the P0 or P * LCP with strong global and local convergence properties

Bibliographic Details
Main Authors: Huang, Z., Sun, Jie
Format: Journal Article
Published: Springer 2005
Online Access:http://hdl.handle.net/20.500.11937/25720
  • Holdings
  • Description
  • Similar Items
  • Staff View

Internet

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

Similar Items

  • 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)
  • Global Convergence Analysis of Line Search Interior-Point Methods for Nonlinear Programming without Regularity Assumptions
    by: Liu, X., et al.
    Published: (2005)
  • Strong convergence of a km iterative algorithm for computing a split common fixed-point of quasi-nonexpansive operators
    by: Dang, Y., et al.
    Published: (2021)
  • A strategy of global convergence for the affine scaling algorithm for convex semidefinite programming
    by: Qian, X., et al.
    Published: (2018)
  • Analysis of some interior point continuous trajectories for convex programming
    by: Qian, X., et al.
    Published: (2017)

Search Options

  • Advanced Search

Find More

  • Browse the Catalog

Need Help?

  • Search Tips