scientific article
From MaRDI portal
zbMath0623.65067MaRDI QIDQ3761588
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Variations and extension of the convex-concave procedure, Global optimization conditions for certain nonconvex minimization problems, DC semidefinite programming and cone constrained DC optimization. I: Theory, The \(C_ M\)-embedded problem and optimality conditions, The design centering problem as a d.c. programming problem, Intersection Disjunctions for Reverse Convex Sets, A new class of multilevel decomposition algorithms for non-monotone problems based on the quasidifferentiability concept, Canonical DC programming problem: Outer approximation methods revisited, SUSPECT: MINLP special structure detector for Pyomo, Global optimization under Lipschitzian constraints, On some geometric conditions for minimality of DCH-functions via DC-duality approach, Beyond canonical dc-optimization: the single reverse polar problem, Convex Maximization via Adjustable Robust Optimization, A finite cutting plane method for solving linear programs with an additional reverse convex constraint, Normal conical algorithm for concave minimization over polytopes, On-line and off-line vertex enumeration by adjacency lists, Computing a global optimal solution to a design centering problem, Unconstrained 0-1 nonlinear programming: A nondifferentiable approach, DC decomposition of nonconvex polynomials with algebraic techniques, Support points, Difference of convex solution of quadratically constrained optimization problems., Convex minimization under Lipschitz constraints, Quasiconjugates of functions, duality relationship between quasiconvex minimization under a reverse convex constraint and quasiconvex maximization under a convex constraint, and applications, A generalized Dantzig-Wolfe decomposition principle for a class of nonconvex programming problems
