From linear to convex systems: consistency, Farkas' Lemma and applications

By Nguyen Dinh, Miguel Angel Goberna, M. A. L. Cerdá. 2006

110 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/4ff527253e3b7dd71e6cfdbe637f42ef4c17764c

How researchers see this paper

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

1. Donghui Fang
2. Chong Li
3. Kung Fu Ng
4. Tran Thai An Nghia
5. Guy Vallet
6. Alexandru Krist'aly

Citations in the corpus

• A closedness condition and its applications to DC programs with convex constraints (2010, methodology): “Note that such a problem can be reduced to the model (Q) by letting h : R!R with h(x)1⁄4 (hi(x))i2 I and S 1⁄4 RIþ [13,14].”
• Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming (2010, background): “Here let us especially mention some recent papers [1,2,10] regarding the problem (1.”