Convexifactors, Generalized Convexity, and Optimality Conditions

By Joydeep Dutta, Suresh Chandra. 2002

72 citations recorded by the source corpus.

Subfields: Cellular and Molecular Neuroscience, Computational Theory and Mathematics, Numerical Analysis

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

How researchers see this paper

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

In Cellular and Molecular Neuroscience

1. Suresh Chandra
2. Joydeep Dutta

In Computational Theory and Mathematics

1. Majid Soleimani-Damaneh
2. Alireza Kabgani
3. Suresh Chandra
4. Joydeep Dutta

In Numerical Analysis

1. Majid Soleimani-Damaneh
2. Alireza Kabgani
3. Suresh Chandra
4. Joydeep Dutta

Citations in the corpus

• Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators (2018, background): “Dutta and Chandra [20] obtained necessary optimality conditions for a single-objective optimization problem with continuous data.”
• Convexifactors, generalized convexity and vector optimization (2004, methodology): “6 in [6] where the boundedness and upper semi-regularilty of the convexifactor were needed to show that pseudomontonicity of such a convexifactor implies the pseudoconvexity of the function (as per Definition 3.”