On solving general reverse convex programming problems by a sequence of linear programs and line searches
From MaRDI portal
Publication:2638938
DOI10.1007/BF02283684zbMath0717.90057OpenAlexW2027010768MaRDI QIDQ2638938
Thai Quynh Phong, Reiner Horst, Nguyen Van Thoai
Publication date: 1990
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02283684
line searchesmultiextremal global optimizationcanonical d.c. programsgeneral reverse convex programmingunivariate convex minimization
Convex programming (90C25) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Constraint decomposition algorithms in global optimization, A method for solving d.c. programming problems. Application to fuel mixture nonconvex optimization problem, Intersection Disjunctions for Reverse Convex Sets, Reverse convex programming approach in the space of extreme criteria for optimization over efficient sets, DC programming: overview., On solving a d.c. programming problem by a sequence of linear programs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A branch and bound-outer approximation algorithm for concave minimization over a convex set
- On the global minimization of concave functions
- Global optimization algorithms for linearly constrained indefinite quadratic problems
- Concave minimization via conical partitions and polyhedral outer approximation
- 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
- Linear programs with an additional reverse convex constraint
- On the convergence of two branch-and-bound algorithms for nonconvex programming problems
- Non-convex methods for computing free boundary equilibria of axially symmetric plasmas
- Duality in nonconvex optimization
- A duality principle for non-convex optimisation and the calculus of variations
- An algorithm for optimizing network flow capacity under economies of scale
- Deterministic methods in constrained global optimization: Some recent advances and new fields of application
- Jointly Constrained Biconvex Programming
- A Conical Algorithm for Globally Minimizing a Concave Function Over a Closed Convex Set
- Global minimization of a difference of two convex functions
- Global optimization under Lipschitzian constraints
- A class of exhaustive cone splitting procedures in conical algorithms for concave minmization
- A modified version of Tuy's method for solving d.c. programing problem
- On an outer approximation concept in global optimization
- A note on the convergence of an algorithm for nonconvex programming problems
- A method for globally minimizing concave functions over convex sets
- Convergent Algorithms for Minimizing a Concave Function
- Optimization Problems Subject to a Budget Constraint with Economies of Scale
- An algorithm for nonconvex programming problems
