An algorithm for nonconvex programming problems
From MaRDI portal
Cites work
Cited in
(84)- 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
- Quadratic problems defined on a convex hull of points
- Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems
- Minimizing a quasi-concave function subject to a reverse convex constraint
- On the global minimization of a convex function under general nonconvex constraints
- A parallel algorithm for constrained concave quadratic global minimization
- Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems
- On the convergence of two branch-and-bound algorithms for nonconvex programming problems
- Algorithms for parametric nonconvex programming
- LP-form inclusion functions for global optimization
- Normal conical algorithm for concave minimization over polytopes
- Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms
- An all-linear programming relaxation algorithm for optimizing over the efficient set
- An algorithm for indefinite quadratic programming with convex constraints
- On solving a d.c. programming problem by a sequence of linear programs
- A new simplicial cover technique in constrained global optimization
- Convergence qualification of adaptive partition algorithms in global optimization
- A new reformulation-linearization technique for bilinear programming problems
- Calculation of bounds on variables satisfying nonlinear inequality constraints
- A low-rank bilinear programming approach for sub-optimal solution of the quadratic assignment problem
- A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set
- Average shadow prices in mathematical programming
- Calculating a minimal sphere containing a polytope defined by a system of linear inequalities
- A finite concave minimization algorithm using branch and bound and neighbor generation
- A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron
- Lagrange duality and partitioning techniques in nonconvex global optimization
- Outcome space partition of the weight set in multiobjective linear programming
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
- Subdivision of simplices relative to a cutting plane and finite concave minimization
- Convex minimization under Lipschitz constraints
- Deletion-by-infeasibility rule for DC-constrained global optimization
- An interval branch and bound algorithm for global optimization of a multiperiod pricing model
- New LP bound in multivariate Lipschitz optimization: Theory and applications
- Decomposition approach for the global minimization of biconcave functions over polytopes
- Linearly constrained global minimization of functions with concave minorants
- New LP-based local and global algorithms for continuous and mixed-integer nonconvex quadratic programming
- Globally maximizing the sum of squares of quadratic forms over the unit sphere
- A note on adapting methods for continuous global optimization to the discrete case
- Separable concave minimization via partial outer approximation and branch and bound
- On the exhaustivity of simplicial partitioning
- A simplicial branch-and-bound algorithm conscious of special structures in concave minimization problems
- On solving general reverse convex programming problems by a sequence of linear programs and line searches
- A decomposition approach for global optimum search in QP, NLP and MINLP problems
- Optimising portfolio diversification and dimensionality
- Optimization over equilibrium sets∗
- Computational methods for solving nonconvex block-separable constrained quadratic problems
- A generalization of -subdivision ensuring convergence of the simplicial algorithm
- Convex Envelopes of Some Quadratic Functions over the n-Dimensional Unit Simplex
- On generalized bisection of 𝑛-simplices
- Global minimization of large-scale constrained concave quadratic problems by separable programming
- A note on the convergence of an algorithm for nonconvex programming 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
- A convergent simplicial algorithm with -subdivision and -bisection strategies
- An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem
- Finding the principal points of a random variable
- Global minimum test problem construction
- Optimization over the efficient set
- On convergence of the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions
- Quasiconvex relaxations based on interval arithmetic
- Biconvex programming approach to optimization over the weakly efficient set of a multiple objective affine fractional problem
- A general purpose exact solution method for mixed integer concave minimization problems
- (Global) optimization: historical notes and recent developments
- On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope
- Hybrid simplicial-randomized approximate stochastic dynamic programming for multireservoir optimization
- Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems
- An algorithm for solving convex programs with an additional convex- concave constraint
- On the global optimization of sums of linear fractional functions over a convex set
- A modified simplicial algorithm for convex maximization based on an extension of \(\omega \)-subdivision
- A branch and bound-outer approximation algorithm for concave minimization over a convex set
- On the convexification of nonlinear programming problems: An applications-oriented survey
- On the global minimization of concave functions
- Algorithms for the solution of quadratic knapsack problems
- Global optimization algorithms for linearly constrained indefinite quadratic problems
- Concave minimization via conical partitions and polyhedral outer approximation
- Interval branch and bound with local sampling for constrained global optimization
- Decomposition methods for solving nonconvex quadratic programs via branch and bound
- Theoretical convergence analysis of a general division-deletion algorithm for solving global search problems
- A computational comparison of some branch and bound methods for indefinite quadratic programs
- Bisecton by global optimization revisited
- A fast memoryless interval-based algorithm for global optimization
This page was built for publication: An algorithm for nonconvex programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4105518)
