On solving a d.c. programming problem by a sequence of linear programs
From MaRDI portal
Publication:1186273
DOI10.1007/BF00119991zbMath0755.90076OpenAlexW1994196671MaRDI QIDQ1186273
Reiner Horst, Nguyen Van Thoai, Thai Quynh Phong, Jakob de Vries
Publication date: 28 June 1992
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00119991
Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Variations and extension of the convex-concave procedure, An algorithm for solving general D. C. programming problems, Branch-and-bound decomposition approach for solving quasiconvex-concave programs, A method for solving d.c. programming problems. Application to fuel mixture nonconvex optimization problem, A generalized karush-kuhn-tucki optimality condition without constraint qualification using tl approximate subdifferential, Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems, Convex Maximization via Adjustable Robust Optimization, Exact penalty and error bounds in DC programming, DC programming: overview., Sequential location of two facilities: comparing random to optimal location of the first facility, The hill detouring method for minimizing hinging hyperplanes functions, A continuous approch for globally solving linearly constrained quadratic, On a Markov Decision Process problem involving the Maximum of the Difference between two functions: Technical Note, The maximization of a function over the efficient set via a penalty function approach, Constructing a DC decomposition for ordered median problems, The simplex method as a global optimizer: A \(C\)-programming perspective
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A branch and bound-outer approximation algorithm for concave minimization over a convex set
- Concave minimization via conical partitions and polyhedral outer approximation
- An outer approximation method for globally minimizing a concave function over a compact convex set
- On outer approximation methods for solving concave minimization problems
- A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
- Convex programs with an additional reverse convex constraint
- On the convergence of global methods in multiextremal optimization
- Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization
- Global minimization of indefinite quadratic problems
- Constrained global optimization: algorithms and applications
- On consistency of bounding operations in deterministic global optimization
- Outer approximation by polyhedral convex sets
- On finding new vertices and redundant constraints in cutting plane algorithms for global optimization
- Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems
- The design centering problem as a d.c. programming problem
- On the global minimization of a convex function under general nonconvex constraints
- Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems
- Non-convex methods for computing free boundary equilibria of axially symmetric plasmas
- Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms
- Computing a global optimal solution to a design centering problem
- A duality principle for non-convex optimisation and the calculus of variations
- On solving general reverse convex programming problems by a sequence of linear programs and line searches
- Deterministic methods in constrained global optimization: Some recent advances and new fields of application
- A Conical Algorithm for Globally Minimizing a Concave Function Over a Closed Convex Set
- Global minimization of a difference of two convex functions
- A modified version of Tuy's method for solving d.c. programing problem
- On an outer approximation concept in global optimization
- Theoretical and computational aspects of the optimal design centering, tolerancing, and tuning problem
- A note on the convergence of an algorithm for nonconvex programming problems
- A method for globally minimizing concave functions over convex sets
- An algorithm for nonconvex programming problems
- A Successive Underestimation Method for Concave Minimization Problems
- Convex Analysis
