An Algorithm for Separable Nonconvex Programming Problems II: Nonconvex Constraints
From MaRDI portal
Cited in
(26)- A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
- Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization
- Algorithms for parametric nonconvex programming
- Global optimization of concave functions subject to quadratic constraints: An application in nonlinear bilevel programming
- Generalized bilinear programming. I: Models, applications and linear programming relaxation
- Calculation of bounds on variables satisfying nonlinear inequality constraints
- The use of Hestenes' method of multipliers to resolve dual gaps in engineering system optimization
- An algorithm for optimizing network flow capacity under economies of scale
- Characterization of local solutions for a class of nonconvex programs
- Deletion-by-infeasibility rule for DC-constrained global optimization
- A branch-and-reduce approach to global optimization
- A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs
- A parallel algorithm for partially separable non-convex global minimization: Linear constraints
- Variations and extension of the convex-concave procedure
- A decomposition approach for global optimum search in QP, NLP and MINLP problems
- A method for globally minimizing concave functions over convex sets
- Bounding a class of nonconvex linearly-constrained resource allocation problems via the surrogate dual
- Global optimization using special ordered sets
- An algorithm for nonconvex programming problems
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Stochastic allocation of inspection capacity to competitive processes
- A general purpose exact solution method for mixed integer concave minimization problems
- (Global) optimization: historical notes and recent developments
- Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems
- Estimation theory for nonlinear models and set membership uncertainty
- Global optimization algorithms for linearly constrained indefinite quadratic problems
This page was built for publication: An Algorithm for Separable Nonconvex Programming Problems II: Nonconvex Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5633840)
