2018/09/26 by Harshal D. Kaushik, Harshal Kaushik, Kaushik, Harshal +2 · 1 citation
Computer Science · Engineering · Mathematics · Medicine · #Applied mathematics #Artificial intelligence #Bilevel optimization #Bone and Joint Diseases #Computer science #Convergence (economics) #Convex optimization #Coordinate descent #Curse of dimensionality #FOS: Mathematics #Iterative method #Mathematical optimization #Mathematics #Norm (philosophy) #Optimization and Control (math.OC) #Optimization problem #Regular polygon #Regularization (linguistics) #Sparse and Compressive Sensing Techniques #Stochastic Gradient Optimization Techniques #Trust region #Well-posed problem #math.OC
paper · pdf · doi:10.48550/arxiv.1809.10035
8 pages, 2 figures, American Control Conference
arxiv created 2018/09/26 · openalex publication_date 2018/09/26 · arxiv updated 2018/09/27 · openalex created_date 2018/10/05 · openalex updated_date 2026/07/28
Motivated by high-dimensional nonlinear optimization problems as well as ill-posed optimization problems arising in image processing, we consider a bilevel optimization model where we seek among the optimal solutions of the inner level problem, a solution that minimizes a secondary metric. Our goal is to address the high-dimensionality of the bilevel problem, and the nondifferentiability of the objective function. Minimal norm gradient, sequential averaging, and iterative regularization are some of the recent schemes developed for addressing the bilevel problem. But none of them address the high-dimensional structure and nondifferentiability. With this gap in the literature, we develop a randomized block coordinate iterative regularized gradient descent scheme (RB-IRG). We establish the convergence of the sequence generated by RB-IRG to the unique solution of the bilevel problem of interest. Furthermore, we derive a rate of convergence O (\frac1k0.5-δ), with respect to the inner level objective function. We demonstrate the performance of RB-IRG in solving the ill-posed problems arising in image processing.