scholarly journals Lagrange Dual Method for Sparsity Constrained Optimization

IEEE Access ◽  
2018 ◽  
Vol 6 ◽  
pp. 28404-28416 ◽  
Author(s):  
Wenxing Zhu ◽  
Zhengshan Dong ◽  
Yuanlong Yu ◽  
Jianli Chen
Keyword(s):  
Constrained Optimization ◽  
Dual Method ◽  
Sparsity Constrained Optimization

scholarly journals A Gradient Projection Algorithm with a New Stepsize for Nonnegative Sparsity-Constrained Optimization

2020 ◽  
Vol 2020 ◽  
pp. 1-7
Author(s):  
Ye Li ◽  
Jun Sun ◽  
Biao Qu
Keyword(s):  
Logistic Regression ◽  
Constrained Optimization ◽  
Cost Function ◽  
Optimization Problem ◽  
Gradient Projection ◽  
Projection Algorithm ◽  
Constrained Optimization Problem ◽  
Gradient Projection Algorithm ◽  
Convergence Results ◽  
Sparsity Constrained Optimization

Nonnegative sparsity-constrained optimization problem arises in many fields, such as the linear compressing sensing problem and the regularized logistic regression cost function. In this paper, we introduce a new stepsize rule and establish a gradient projection algorithm. We also obtain some convergence results under milder conditions.

A dual method for constrained optimization design in magnetostatic problems

1991 ◽  
Vol 27 (5) ◽  
pp. 4136-4141 ◽  
Author(s):  
R.R. Saldanha ◽  
J.L. Coulomb ◽  
A. Foggia ◽  
J.C. Sabonnadiere
Keyword(s):  
Constrained Optimization ◽  
Optimization Design ◽  
Dual Method
Sign in / Sign up

Export Citation Format

Share Document