On Tikhonov's reciprocity principle and optimality conditions in d. c. optimization
From MaRDI portal
Publication:1270696
DOI10.1006/jmaa.1998.6040zbMath0909.90247OpenAlexW2087341726MaRDI QIDQ1270696
Publication date: 29 November 1998
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jmaa.1998.6040
optimality conditionsd.c. optimizationpair of nonconvex optimization problemsTikhonov's reciprocity principle
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Nonsmooth analysis (49J52)
Related Items
On global optimality conditions and cutting plane algorithms, A new necessary and sufficient global optimality condition for canonical DC problems, DC programming: overview.
Cites Work
- Canonical d. c. programming techniques for solving a convex program with an additional constraint of multiplicative type
- Convex programs with an additional reverse convex constraint
- Constraint decomposition algorithms in global optimization
- Introduction to global optimization
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item