An algorithm for nonconvex programming problems
From MaRDI portal
Publication:4105518
DOI10.1007/BF01580678zbMath0337.90062OpenAlexW2023582597MaRDI QIDQ4105518
Publication date: 1976
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01580678
Related Items
Calculating a minimal sphere containing a polytope defined by a system of linear inequalities, On the convergence of global methods in multiextremal optimization, A finite concave minimization algorithm using branch and bound and neighbor generation, New LP-based local and global algorithms for continuous and mixed-integer nonconvex quadratic programming, A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron, A generalization of \(\omega \)-subdivision ensuring convergence of the simplicial algorithm, Finding the principal points of a random variable, Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization, Deletion-by-infeasibility rule for DC-constrained global optimization, An interval branch and bound algorithm for global optimization of a multiperiod pricing model, 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, Quadratic problems defined on a convex hull of points, Global minimization of large-scale constrained concave quadratic problems by separable programming, Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems, New LP bound in multivariate Lipschitz optimization: Theory and applications, Minimizing a quasi-concave function subject to a reverse convex constraint, On the global minimization of a convex function under general nonconvex constraints, Theoretical convergence analysis of a general division-deletion algorithm for solving global search problems, A parallel algorithm for constrained concave quadratic global minimization, Lagrange duality and partitioning techniques in nonconvex global optimization, Decomposition approach for the global minimization of biconcave functions over polytopes, Linearly constrained global minimization of functions with concave minorants, Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems, Optimising portfolio diversification and dimensionality, Convex Envelopes of Some Quadratic Functions over the n-Dimensional Unit Simplex, A general purpose exact solution method for mixed integer concave minimization problems, (Global) optimization: historical notes and recent developments, On the convergence of two branch-and-bound algorithms for nonconvex programming problems, A convergent simplicial algorithm with \(\omega \)-subdivision and \(\omega \)-bisection strategies, An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem, Algorithms for parametric nonconvex programming, On the exhaustivity of simplicial partitioning, On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope, Optimization over equilibrium sets∗, 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, Globally maximizing the sum of squares of quadratic forms over the unit sphere, An algorithm for indefinite quadratic programming with convex constraints, A computational comparison of some branch and bound methods for indefinite quadratic programs, Optimization over the efficient set, 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, 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, A new reformulation-linearization technique for bilinear programming problems, On convergence of the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions, A simplicial branch-and-bound algorithm conscious of special structures in concave minimization problems, Quasiconvex relaxations based on interval arithmetic, Bisecton by global optimization revisited, Calculation of bounds on variables satisfying nonlinear inequality constraints, On the global optimization of sums of linear fractional functions over a convex set, Biconvex programming approach to optimization over the weakly efficient set of a multiple objective affine fractional problem, A fast memoryless interval-based algorithm for global optimization, A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs, A note on adapting methods for continuous global optimization to the discrete case, Separable concave minimization via partial outer approximation and branch and bound, A modified simplicial algorithm for convex maximization based on an extension of \(\omega \)-subdivision, A note on the convergence of an algorithm for nonconvex programming problems, A method for globally minimizing concave functions over convex sets, Computational Methods for Solving Nonconvex Block-Separable Constrained Quadratic Problems, Bounding a class of nonconvex linearly-constrained resource allocation problems via the surrogate dual, Subdivision of simplices relative to a cutting plane and finite concave minimization, A branch and bound-outer approximation algorithm for concave minimization over a convex set, A low-rank bilinear programming approach for sub-optimal solution of the quadratic assignment problem, Convex minimization under Lipschitz constraints, Outcome space partition of the weight set in multiobjective linear programming, On generalized bisection of 𝑛-simplices, Global minimum test problem construction, 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, A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization, 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, Convex programs with an additional reverse convex constraint, A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set, Average shadow prices in mathematical programming
Cites Work
