☆ 4.7 Article

A new approach to characterize the solution set of a pseudoconvex programming problem

JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS (2014)

Get Full Text
Add to Collection

Journal

JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS
Volume 261, Issue -, Pages 333-340

Publisher

ELSEVIER SCIENCE BV
DOI: 10.1016/j.cam.2013.11.004

Keywords

Mixed type duality; Lagrange function; Solution set

Categories

Mathematics, Applied

Funding

  1. Basic Science Research Program through the National Research Foundation of Korea (NRF)
  2. Ministry of Education, Science and Technology [2010-0012780]
  3. National Foundation for Science and Technology Development (NAFOSTED) Vietnam
  4. National Research Foundation of Korea [2010-0012780] Funding Source: Korea Institute of Science & Technology Information (KISTI), National Science & Technology Information Service (NTIS)

Ask authors/readers for more resources

Protocol

Community support

Reagent

Community support

A new approach to characterize the solution set of a nonconvex optimization problem via its dual problem is proposed. Some properties of the Lagrange function associated to the problem are investigated. Then characterizations of the solution set of the problem are established. (C) 2013 Elsevier B.V. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available
Webinars Posters Questions Hubs Funding Journals Papers Connect Collections Reviewers About Us FAQs Mobile App Privacy Policy Terms of Use
© Peeref 2019-2024. All rights reserved.