scientific article; zbMATH DE number 3920207
convex optimizationdual methodgeneralized subgradientsnonconvex problemsparametric complementary problems
Numerical methods based on nonlinear programming (49M37) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
[For the entire collection see Zbl 0571.00016.] The dual method of solving convex optimization problems, which can be considered as an application of both parametric programming and the theory of subgradients is shown to be generalizable to nonconvex problems by applying theoretical results of generalized subgradients in the sense of Clarke and on parametric complementary problems. Starting from the description of the ordinary dual method, the foundations of locally dual methods are presented for the nonconvex case. The special cases of quadratic optimization and of problems with strictly stable initial point are discussed with respect to the theoretical aspects. The algorithm of the generalized dual method is thus found and is presented in the last chapter of the paper.
- scientific article; zbMATH DE number 5630471 (Why is no real title available?)
- scientific article; zbMATH DE number 1382305 (Why is no real title available?)
- A parametric solution algorithm for a class of rank-two nonconvex programs
- Parametric duality on minimax programming involving generalized convexity in complex space
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3695002)