A modified version of Tuy's method for solving d.c. programing problem

DOI10.1080/02331938808843381zbMath0662.90069OpenAlexW2567978439MaRDI QIDQ3813618

Nguyen Van Thoai

Publication date: 1988

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331938808843381

zbMATH Keywords

algorithmd.c. programmingcanonical formsimplementationcutting method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items

A method for solving d.c. programming problems. Application to fuel mixture nonconvex optimization problem, On solving general reverse convex programming problems by a sequence of linear programs and line searches, Canonical DC programming problem: Outer approximation methods revisited, Outer approximation algorithms for DC programs and beyond, On global optimality conditions and cutting plane algorithms, A new necessary and sufficient global optimality condition for canonical DC problems, Computing a global optimal solution to a design centering problem, Mathematical programs with a two-dimensional reverse convex constraint, On solving a d.c. programming problem by a sequence of linear programs, Canonical d. c. programming techniques for solving a convex program with an additional constraint of multiplicative type, On an outer approximation concept in global optimization, Successive search methods for solving a canonical DC programming problem, Calculation of bounds on variables satisfying nonlinear inequality constraints, On global unconstrained minimization of the difference of polyhedral functions, Outer approximation algorithms for canonical DC problems

Cites Work

• On outer approximation methods for solving concave minimization problems
• On finding new vertices and redundant constraints in cutting plane algorithms for global optimization
• The Cutting-Plane Method for Solving Convex Programs
• Unnamed Item