D.C. programming approach for solving an applied ore-processing problem
type: Item
instance of: scholarly article
title: D.C. programming approach for solving an applied ore-processing problem
zbMATH Open document ID: 1412.90120
published in: Journal of Industrial and Management Optimization
publication date: 2019-02-05T00:00:00Z
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C90
Mathematics Subject Classification ID: 90C20
zbMATH DE Number: 7012493
zbMATH Keywords: identification and modeling
zbMATH Keywords: nonconvex optimization
zbMATH Keywords: indefinite quadratic programming
zbMATH Keywords: difference of two convex functions
zbMATH Keywords: local and global searches
author: R. Enkhbat
author: Tatiana V. Gruzdeva
author: Maria Barkova
MaRDI profile type: Publication
full work available at URL: jimo.2017063
OpenAlex ID: W2698776902
cites work: General Quadratic Programming and Its Applications in Response Surface Analysis
cites work: Q3531028
cites work: Local search in problems with nonconvex constraints
cites work: Introduction to global optimization
cites work: Generalized Farkas' lemma and gap-free duality for minimax DC optimization with polynomials and robust quadratic optimization
cites work: Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
cites work: DC programming: overview.
cites work: Numerical Optimization
cites work: Abstract convexity and global optimization
cites work: Optimality conditions in global optimization and their applications
cites work: On local search in d.c. optimization problems
cites work: On Solving Optimization Problems with Hidden Nonconvex Structures
cites work: Q5693853
cites work: On the numerical solution of the problem of nonconvex optimization
cites work: On a local and global search involved in nonconvex optimization problems
cites work: The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
cites work: Sufficient conditions for global optimality of bivalent nonconvex quadratic programs with inequality constraints
cites work: Global optimality conditions for some classes of optimization problems
DOI: 10.3934/JIMO.2017063
description: scientific article; zbMATH DE number 7012493