D.C. programming approach for solving an applied ore-processing problem
From MaRDI portal
Publication:1716969
DOI10.3934/jimo.2017063zbMath1412.90120OpenAlexW2698776902MaRDI QIDQ1716969
Maria V. Barkova, Rentsen Enkhbat, Tatiana V. Gruzdeva
Publication date: 5 February 2019
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2017063
nonconvex optimizationdifference of two convex functionsindefinite quadratic programmingidentification and modelinglocal and global searches
Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)
Related Items (3)
A local search method for optimization problem with d.c. inequality constraints ⋮ Fractional programming approach to a cost minimization problem in electricity market ⋮ Application of survival theory in mining industry
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generalized Farkas' lemma and gap-free duality for minimax DC optimization with polynomials and robust quadratic optimization
- On local search in d.c. optimization problems
- Global optimality conditions for some classes of optimization problems
- Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
- Optimality conditions in global optimization and their applications
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Introduction to global optimization
- DC programming: overview.
- Sufficient conditions for global optimality of bivalent nonconvex quadratic programs with inequality constraints
- On a local and global search involved in nonconvex optimization problems
- On Solving Optimization Problems with Hidden Nonconvex Structures
- General Quadratic Programming and Its Applications in Response Surface Analysis
- Numerical Optimization
- Local search in problems with nonconvex constraints
- Abstract convexity and global optimization
This page was built for publication: D.C. programming approach for solving an applied ore-processing problem
