Pages that link to "Item:Q685859"

The following pages link to Canonical d. c. programming techniques for solving a convex program with an additional constraint of multiplicative type (Q685859):

Displaying 9 items.

• Reverse convex programming approach in the space of extreme criteria for optimization over efficient sets (Q613601) (← links)
• Convergence and application of a decomposition method using duality bounds for nonconvex global optimization (Q700712) (← links)
• Simplicial branch-and-reduce algorithm for convex programs with a multiplicative constraint (Q987514) (← links)
• Branch-and-reduce algorithm for convex programs with additional multiplicative constraints (Q1042085) (← links)
• On Tikhonov's reciprocity principle and optimality conditions in d. c. optimization (Q1270696) (← links)
• Constraint decomposition algorithms in global optimization (Q1342897) (← links)
• Decomposition approach for the global minimization of biconcave functions over polytopes (Q1918288) (← links)
• Canonical DC programming problem: Outer approximation methods revisited (Q1919172) (← links)
• On optimization over the efficient set in linear multicriteria programming (Q2471110) (← links)