Algorithms for Asymptotically Exact Minimizations in Karush-Kuhn-Tucker Methods
- Koudi Jean
- Guy Degla
- Babacar Mbaye Ndiaye
- Mamadou Traoré
Abstract
We provide two new algorithms with applications to asymptotically exact minimizations with inequalities constraints. These results generalize and improve the works of Andreani, Birgin, Martinez and Schuverdt on minimization with equality constraints. Numerical examples show that our proposed analysis gives convergence results.- Full Text: PDF
- DOI:10.5539/jmr.v10n2p36
This work is licensed under a Creative Commons Attribution 4.0 License.
Index
- Academic Journals Database
- ACNP
- Aerospace Database
- BASE (Bielefeld Academic Search Engine)
- Civil Engineering Abstracts
- CNKI Scholar
- COPAC
- DTU Library
- EconPapers
- Elektronische Zeitschriftenbibliothek (EZB)
- EuroPub Database
- Google Scholar
- Harvard Library
- IDEAS
- Infotrieve
- JournalTOCs
- LOCKSS
- MathGuide
- MathSciNet
- MIAR
- PKP Open Archives Harvester
- Publons
- RePEc
- ResearchGate
- Scilit
- SHERPA/RoMEO
- SocioRePEc
- Standard Periodical Directory
- Technische Informationsbibliothek (TIB)
- The Keepers Registry
- UCR Library
- Universe Digital Library
- WorldCat
Contact
- Sophia WangEditorial Assistant
- jmr@ccsenet.org