An active-set based recursive approach for solving convex isotonic regression with generalized order restrictions

04/01/2023
by   Xuyu Chen, et al.
0

This paper studies the convex isotonic regression with generalized order restrictions induced by a directed tree. The proposed model covers various intriguing optimization problems with shape or order restrictions, including the generalized nearly isotonic optimization and the total variation on a tree. Inspired by the success of the pool-adjacent-violator algorithm and its active-set interpretation, we propose an active-set based recursive approach for solving the underlying model. Unlike the brute-force approach that traverses an exponential number of possible active-set combinations, our algorithm has a polynomial time computational complexity under mild assumptions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/31/2021

Exponential Savings in Agnostic Active Learning through Abstention

We show that in pool-based active classification without assumptions on ...
research
11/06/2020

A dynamic programming approach for generalized nearly isotonic optimization

Shape restricted statistical estimation problems have been extensively s...
research
06/28/2021

The Reward-Penalty-Selection Problem

The Set Cover Problem (SCP) and the Hitting Set Problem (HSP) are well-s...
research
04/26/2019

Improving the complexity of Parys' recursive algorithm

Parys has recently proposed a quasi-polynomial version of Zielonka's rec...
research
10/10/2018

On the Complexity of Solution Extension of Optimization Problems

The question if a given partial solution to a problem can be extended re...
research
02/13/2019

Optimization problems with low SWaP tactical Computing

In a resource-constrained, contested environment, computing resources ne...
research
09/03/2019

Contractility of continuous optimization

By introducing the concept of contractility, all the possible continuous...

Please sign up or login with your details

Forgot password? Click here to reset