The Hardness of Finding Linear Ranking Functions for Lasso Programs
Finding whether a linear-constraint loop has a linear ranking function is an important key to understanding the loop behavior, proving its termination and establishing iteration bounds. If no preconditions are provided, the decision problem is known to be in coNP when variables range over the intege...
Main Author: | Amir M. Ben-Amram |
---|---|
Format: | Article |
Language: | English |
Published: |
Open Publishing Association
2014-08-01
|
Series: | Electronic Proceedings in Theoretical Computer Science |
Online Access: | http://arxiv.org/pdf/1408.5955v1 |
Similar Items
-
Seagull: lasso, group lasso and sparse-group lasso regularization for linear regression models via proximal gradient descent
by: Jan Klosa, et al.
Published: (2020-09-01) -
A Convex LASSO Framework for Linear Timetabling
by: Ali Ahmed Al-Matouq
Published: (2020-01-01) -
Adaptive Group Lasso for Multivariate Linear Regression
by: Shing-Hung Yeh, et al.
Published: (2009) -
Hi-LASSO: High-Dimensional LASSO
by: Youngsoon Kim, et al.
Published: (2019-01-01) -
Statistical Properties of Lasso-Shape Polymers and Their Implications for Complex Lasso Proteins Function
by: Pawel Dabrowski-Tumanski, et al.
Published: (2019-04-01)