A closedness condition and its applications to DC programs with convex constraints

By Nguyen Dinh, Tran Thai An Nghia, Guy Vallet. 2010

81 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Control and Systems Engineering, Numerical Analysis

View Paper: https://www.semanticscholar.org/paper/fddf889155b4d719b1ffe53e9cd4b4431ace344a

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Joydeep Dutta
2. Nguyen Dinh
3. Stephan Dempe
4. Boris S. Mordukhovich
5. Truong Quang Bao
6. Maria Paola Scaparra
7. Richard L. Church

In Control and Systems Engineering

1. Joydeep Dutta
2. Nguyen Dinh
3. Stephan Dempe
4. Boris S. Mordukhovich
5. Truong Quang Bao
6. Maria Paola Scaparra
7. Richard L. Church

In Numerical Analysis

1. Stephan Dempe
2. Joydeep Dutta
3. Nguyen Dinh

Citations in the corpus

• Optimality Conditions for a Simple Convex Bilevel Programming Problem (2010, methodology): “They have been used extensively in [6, 8 , 9], and others (see the references in the papers listed above) to establish optimality conditions, duality results for DC programs subject to cone constraints, and extended to infinite convex and DC problems (infinitely many convex constraints, in infinite”