EconPapers    
Economics at your fingertips  
 

An active-set algorithmic framework for non-convex optimization problems over the simplex

Andrea Cristofari (), Marianna Santis (), Stefano Lucidi () and Francesco Rinaldi ()
Additional contact information
Andrea Cristofari: Università di Padova
Marianna Santis: Sapienza Università di Roma
Stefano Lucidi: Sapienza Università di Roma
Francesco Rinaldi: Università di Padova

Computational Optimization and Applications, 2020, vol. 77, issue 1, No 3, 57-89

Abstract: Abstract In this paper, we describe a new active-set algorithmic framework for minimizing a non-convex function over the unit simplex. At each iteration, the method makes use of a rule for identifying active variables (i.e., variables that are zero at a stationary point) and specific directions (that we name active-set gradient related directions) satisfying a new “nonorthogonality” type of condition. We prove global convergence to stationary points when using an Armijo line search in the given framework. We further describe three different examples of active-set gradient related directions that guarantee linear convergence rate (under suitable assumptions). Finally, we report numerical experiments showing the effectiveness of the approach.

Keywords: Active-set methods; Unit simplex; Non-convex optimization; Large-scale optimization; 65K05; 90C06; 90C30 (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://link.springer.com/10.1007/s10589-020-00195-x Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:coopap:v:77:y:2020:i:1:d:10.1007_s10589-020-00195-x

Ordering information: This journal article can be ordered from
http://www.springer.com/math/journal/10589

DOI: 10.1007/s10589-020-00195-x

Access Statistics for this article

Computational Optimization and Applications is currently edited by William W. Hager

More articles in Computational Optimization and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

 
Page updated 2025-04-17
Handle: RePEc:spr:coopap:v:77:y:2020:i:1:d:10.1007_s10589-020-00195-x