✦ LIBER ✦

Generic Well-Posedness of Nonconvex Constrained Variational Problems

✍ Scribed by A. J. Zaslavski

Publisher: Springer
Year: 2006
Tongue: English
Weight: 227 KB
Volume: 130
Category: Article
ISSN: 0022-3239
DOI: 10.1007/s10957-006-9115-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Generic Well-Posedness of Constrained Va

Generic Well-Posedness of Constrained Variational Problems Without Convexity Assumptions

✍ A. J. Zaslavski 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 131 KB

Generic well-posedness of nonconvex opti

Generic well-posedness of nonconvex optimal control problems

✍ Alexander J. Zaslavski 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 324 KB

Well-posedness of constrained minimizati

Well-posedness of constrained minimization problems via saddle-points

✍ Biagio Ricceri 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 131 KB

Levitin–Polyak well-posedness of constra

Levitin–Polyak well-posedness of constrained vector optimization problems

✍ X. X. Huang; X. Q. Yang 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 225 KB

Generic well-posedness of minimization p

Generic well-posedness of minimization problems with mixed continuous constraints

✍ Alexander J. Zaslavski 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 178 KB

Generic well-posedness of minimization p

Generic well-posedness of minimization problems with mixed smooth constraints

✍ Alexander J. Zaslavski 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 348 KB

In this paper we study mathematical programming problems with mixed smooth constraints in a Banach space and show that most of the problems (in the Baire category sense) are well-posed. Our result is a generalization of a result of A.D. Ioffe et al. [A variational principle for problems with functio