Convex programs with an additional reverse convex constraint
From MaRDI portal
Publication:1071651
DOI10.1007/BF00938217zbMath0585.90071OpenAlexW2016408076MaRDI QIDQ1071651
Publication date: 1987
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00938217
global optimizationouter approximationreverse convex constraintsclosed convex domainsequence of subproblems
Numerical mathematical programming methods (65K05) Convex programming (90C25) Methods of successive quadratic programming type (90C55)
Related Items
Convex programs with an additional constraint on the product of several convex functions, A revision of the rectangular algorithm for a class of DC optimization problems, On solving general reverse convex programming problems by a sequence of linear programs and line searches, 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, 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, A branch-and-reduce approach to global optimization, Outer approximation algorithms for DC programs and beyond, Global optimization under Lipschitzian constraints, Beyond canonical dc-optimization: the single reverse polar problem, A polynomial-time algorithm for a nonconvex chance-constrained program under the normal approximation, Duality and optimality conditions for reverse convex programs via a convex decomposition, Global optimality test for maximin solution of bilevel linear programming with ambiguous lower-level objective function, Necessary optimality conditions for vector reverse convex minimization problems via a conjugate duality, On global optimality conditions and cutting plane algorithms, A new necessary and sufficient global optimality condition for canonical DC problems, New necessary and sufficient optimality conditions for strong bilevel programming problems, Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision, A finite cutting plane method for solving linear programs with an additional reverse convex constraint, On the use of cuts in reverse convex programs, A feasible point adaptation of the Blankenship and Falk algorithm for semi-infinite programming, An extended conjugate duality for generalized semi-infinite programming problems via a convex decomposition, DC programming: overview., Global optimization for special reverse convex programming, The complexity results of the sparse optimization problems and reverse convex optimization problems, Mathematical programs with a two-dimensional reverse convex constraint, On solving a d.c. programming problem by a sequence of linear programs, The complementary convex structure in global optimization, New types of variational principles based on the notion of quasidifferentiability, A generalized duality and applications, On an outer approximation concept in global optimization, Successive search methods for solving a canonical DC programming problem, An algorithm for solving convex programs with an additional convex- concave constraint, Calculation of bounds on variables satisfying nonlinear inequality constraints, Optimization-based stability analysis of structures under unilateral constraints, Outer approximation algorithms for canonical DC problems, \({{\mathcal {D}(\mathcal {C})}}\)-optimization and robust global optimization, What is quasiconvex analysis?, New global optimality conditions for nonsmooth DC optimization problems, Difference of convex solution of quadratically constrained optimization problems., Construction of test problems for concave minimization under linear and nonlinear constraints, A level set algorithm for a class of reverse convex programs, On Tikhonov's reciprocity principle and optimality conditions in d. c. optimization, Convex minimization under Lipschitz constraints, Computational experience using an edge search algorithm for linear reverse convex programs, Fuzzy linear and affine spaces, Some comments on Russell graph efficiency measures in data envelopment analysis: the multiplicative approach, Quasiconjugates of functions, duality relationship between quasiconvex minimization under a reverse convex constraint and quasiconvex maximization under a convex constraint, and applications, Primal-relaxed dual global optimization approach, Generalized Semi-Infinite Programming: Optimality Conditions Involving Reverse Convex Problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Global minimization of a concave function subject to mixed linear and reverse convex constraints
- An outer approximation method for globally minimizing a concave function over a compact convex set
- Minimizing a concave function over a compact convex set
- On outer approximation methods for solving concave minimization problems
- Linear programs with an additional reverse convex constraint
- Reverse convex programming
- Characterization of local solutions for a class of nonconvex programs
- A Conical Algorithm for Globally Minimizing a Concave Function Over a Closed Convex Set
- A method for globally minimizing concave functions over convex sets
- Minimization of continuous convex functional on complements of convex subsets of locally convex spaces1
- Complementary Geometric Programming
- An algorithm for nonconvex programming problems
- A Successive Underestimation Method for Concave Minimization Problems
- Convex Analysis
- The Validity of a Family of Optimization Methods
- Iterative Solution of Nonlinear Optimal Control Problems
