D.C. programming approach for solving an applied ore-processing problem
From MaRDI portal
Recommendations
- D.C. Constrained optimization approach for solving metal recovery processing problem
- scientific article; zbMATH DE number 4011808
- A method for solving d.c. programming problems. Application to fuel mixture nonconvex optimization problem
- On solving a d.c. programming problem by a sequence of linear programs
- scientific article; zbMATH DE number 6311514
Cites work
- Abstract convexity and global optimization
- DC programming: overview.
- General quadratic programming and its applications in response surface analysis
- Generalized Farkas' lemma and gap-free duality for minimax DC optimization with polynomials and robust quadratic optimization
- Global optimality conditions for some classes of optimization problems
- scientific article; zbMATH DE number 5355239 (Why is no real title available?)
- scientific article; zbMATH DE number 2210595 (Why is no real title available?)
- Introduction to global optimization
- Local search in problems with nonconvex constraints
- Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
- Numerical Optimization
- On a local and global search involved in nonconvex optimization problems
- On local search in d.c. optimization problems
- On solving optimization problems with hidden nonconvex structures
- On the numerical solution of the problem of nonconvex optimization
- Optimality conditions in global optimization and their applications
- Sufficient conditions for global optimality of bivalent nonconvex quadratic programs with inequality constraints
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
Cited in
(4)
This page was built for publication: D.C. programming approach for solving an applied ore-processing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1716969)
