Generalized-Hukuhara Subgradient Method for Optimization Problem with Interval-valued Functions and its Application in Lasso Problem

Abstract

In this study, a gH-subgradient technique is developed to obtain efficient solutions to the optimization problems with nonsmooth nonlinear convex interval-valued functions. The algorithmic implementation of the developed gH-subgradient technique is illustrated. As an application of the proposed gH-subgradient technique, an 1 penalized linear regression problem, known as a lasso problem, with interval-valued features is solved.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…