An alternating linearization method with inexact data for bilevel nonsmooth convex optimization

DOI10.3934/jimo.2014.10.859zbMath1292.90235OpenAlexW2333150748MaRDI QIDQ2438407

Zun-Quan Xia, Dan Li, Fang-Fang Guo, Li-Ping Pang

Publication date: 11 March 2014

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2014.10.859

zbMATH Keywords

nonsmooth optimizationconvex programmingbilevel programmingproximal pointexact penalty function

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Nonsmooth analysis (49J52) Numerical methods based on nonlinear programming (49M37) Decomposition methods (49M27)

Related Items (1)

Nonexpansiveness of a linearized augmented Lagrangian operator for hierarchical convex optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Foundations of bilevel programming
• Approximations in proximal bundle methods and decomposition of convex programs
• Monotone Operators and the Proximal Point Algorithm
• Practical Aspects of the Moreau--Yosida Regularization: Theoretical Preliminaries
• Variational Analysis
• Proximal Decomposition Via Alternating Linearization
• Sufficiency of Exact Penalty Minimization
• A Bundle Method for a Class of Bilevel Nonsmooth Convex Minimization Problems
• Convex Analysis
• A proximal bundle method based on approximate subgradients

This page was built for publication: An alternating linearization method with inexact data for bilevel nonsmooth convex optimization