Skip to content
Open Access
  • Home
  • Collections
    • High Impact Articles
    • Jawi Collection
    • Malay Medicine
    • Forensic
  • Search Options
    • UiTM Open Access
    • Search by UiTM Scopus
    • Advanced Search
    • Search by Category
  • Discovery Service
    • Sources
    • UiTM Journals
    • List UiTM Journal in IR
    • Statistic
  • About
    • Open Access
    • Creative Commons Licenses
    • COKI | Malaysia Open Access
    • User Guide
    • Contact Us
    • Search Tips
    • FAQs
Advanced
  • Search
  • Interior point methods for con...
  • Cite this
  • Text this
  • Email this
  • Print
  • Export Record
    • Export to RefWorks
    • Export to EndNoteWeb
    • Export to EndNote
  • Permanent link
Interior point methods for convex optimization

Interior point methods for convex optimization

Bibliographic Details
Main Author: Lin, Chin-Yee
Published: Georgia Institute of Technology 2007
Subjects:
Convex functions
Nonlinear programming
Online Access:http://hdl.handle.net/1853/15044
  • Holdings
  • Description
  • Similar Items
  • Staff View

Internet

http://hdl.handle.net/1853/15044

Similar Items

  • A convex hull algorithm optimal for point sets in even dimensions
    by: Seidel, Raimund
    Published: (2010)
  • Continuous methods for convex programming and convex semidefinite programming
    by: Qian, Xun
    Published: (2017)
  • Non-differentiable multiobjective mixed symmetric duality under generalized convexity
    by: Li Jueyou, et al.
    Published: (2011-01-01)
  • Convex programming without constraint qualification : a study of Pareto optimality
    by: Fraklin, Martin Gordon.
    Published: (1975)
  • Interior point method for linear and convex optimizations.
    Published: (1998)

© 2020 | Services hosted by the Perpustakaan Tun Abdul Razak, | Universiti Teknologi MARA | Disclaimer


Loading...