An alternating linearization method with inexact data for bilevel nonsmooth convex optimization (Q2438407): Difference between revisions

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