Extremal problems with d.c.-contraints.

MaRDI QIDQ1395156zbMATH OpenFDO

Authors A. S. Strekalovskiĭ

Publication date 29 June 2003

Published in Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

zbMATH Keywords

global optimumconstraintsnecessary and sufficient conditionsd.c.-functionnonconvex mathematical programming problem

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Optimality conditions for solutions belonging to restricted classes (Lipschitz controls, bang-bang controls, etc.) (49K30)

Recommendations

• scientific article; zbMATH DE number 2206827
• scientific article; zbMATH DE number 2084880
• An algorithm for solving general D. C. programming problems
• On solving a d.c. programming problem by a sequence of linear programs
• scientific article; zbMATH DE number 4011808

Cited in

(7)

• On a global search in D.C. optimization problems
• On a continuous approach for the maximum weighted clique problem
• Difference of convex solution of quadratically constrained optimization problems.
• On computational search for optimistic solutions in bilevel problems
• On solution of one equation with d.c. function
• Reformulations in Mathematical Programming: Definitions and Systematics
• scientific article; zbMATH DE number 2206827 (Why is no real title available?)

This page was built for publication: Extremal problems with d.c.-contraints.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1395156)