pith. sign in

arxiv: math/0603741 · v1 · pith:KBVG7CJ7new · submitted 2006-03-31 · 🧮 math.OC

A regularization method for ill-posed bilevel optimization problems

classification 🧮 math.OC
keywords problemsbilevelmethodregularizationsolutionsallowsapproachapproximated
0
0 comments X
read the original abstract

We present a regularization method to approach a solution of the pessimistic formulation of ill -posed bilevel problems . This allows to overcome the difficulty arising from the non uniqueness of the lower level problems solutions and responses. We prove existence of approximated solutions, give convergence result using Hoffman-like assumptions. We end with objective value error estimates.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.