Skip to content
VuFind
Advanced
  • Global Convergence Analysis of...
  • Cite this
  • Print
  • Export Record
    • Export to RefWorks
    • Export to EndNoteWeb
    • Export to EndNote
Global Convergence Analysis of Line Search Interior-Point Methods for Nonlinear Programming without Regularity Assumptions
QR Code

Global Convergence Analysis of Line Search Interior-Point Methods for Nonlinear Programming without Regularity Assumptions

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

Internet

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

Similar Items

  • A robust primal-dual interior-point algorithm for nonlinear programs
    by: Liu, X., et al.
    Published: (2004)
  • Global and local convergence of a filter line search method for nonlinear programming.
    by: Chin, Choong Ming, et al.
    Published: (2007)
  • A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs
    by: Dai, Y.H., et al.
    Published: (2020)
  • Generalized stationary points and an interior-point method for mathematical programs with equilibrium constraints
    by: Liu, X., et al.
    Published: (2004)
  • Global convergence of a new class nonlinear conjugate gradient method with exact line search

Search Options

  • Advanced Search

Find More

  • Browse the Catalog

Need Help?

  • Search Tips