Concave programming and DH-point
From MaRDI portal
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56) Optimization problems in optics and electromagnetic theory (78M50)
Recommendations
- Optimization and duality of cone-d.c. programming
- Duality and Convex Programming
- Duality and Convex Programming
- scientific article; zbMATH DE number 4135708
- Solving polyhedral d.c. optimization problems via concave minimization
- On cone d. c. optimization and conjugate duality
- scientific article; zbMATH DE number 205654
- Conjugate duality for concave maximization problems and applications
- Solving cone-constrained convex programs by differential inclusions
- scientific article; zbMATH DE number 3856836
Cites work
- scientific article; zbMATH DE number 3525695 (Why is no real title available?)
- scientific article; zbMATH DE number 757676 (Why is no real title available?)
- A continuous version of a result of Du and Hwang
- Convex analysis and global optimization
- Mathematical theory of optimization
- Minimax theorems revisited
- Sur certains espaces vectoriels topologiques
- The Steiner ratio conjecture of Gilbert and Pollak is true.
This page was built for publication: Concave programming and DH-point
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1029682)