Nonlinear Programming: Counterexamples to Two Global Optimization Algorithms
From MaRDI portal
Publication:5183286
DOI10.1287/opre.21.6.1260zbMath0274.90049OpenAlexW2068401516WikidataQ124808511 ScholiaQ124808511MaRDI QIDQ5183286
Publication date: 1973
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.21.6.1260
Numerical mathematical programming methods (65K05) Convex programming (90C25) Quadratic programming (90C20)
Related Items
A branch and bound algorithm for extreme point mathematical programming problems, A successive linear approximation algorithm for the global minimization of a concave quadratic program, An approach to multi-start clustering for global optimization with non-linear constraints, Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization, A decomposition approach for global optimum search in QP, NLP and MINLP problems, A reformulation-convexification approach for solving nonconvex quadratic programming problems, Integral global minimization: Algorithms, implementations and numerical tests, Properties of the general quadratic optimization problem and the corresponding linear complementarity problem, Convergence of a Tuy-type algorithm for concave minimization subject to linear inequality constraints, Jointly constrained bilinear programs and related problems: An overview, Normal conical algorithm for concave minimization over polytopes, Accelerating convergence of cutting plane algorithms for disjoint bilinear programming, Degeneracy removal in cutting plane methods for disjoint bilinear programming, A new reformulation-linearization technique for bilinear programming problems, A cutting plane algorithm for solving bilinear programs, Maximization of A convex quadratic function under linear constraints, A relaxation algorithm for the minimization of a quasiconcave function on a convex polyhedron, Bilinear programming: An exact algorithm, A convergent conical algorithm with \(\omega \)-bisection for concave minimization, On the convergence of cone splitting algorithms with \(\omega\)-subdivisions, An extreme-point-ranking algorithm for the extreme-point mathematical programming problem, Maximization of linearly constrained posynomials, A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts, On Non Overlapping Segmentation of the Response Surfaces for Solving Constrained Programming Problems Through Super Convergent Line Series, Monotone variable-metric algorithm for linearly constrained nonlinear programming, Convergence of a subgradient method for computing the bound norm of matrices, On the global minimization of concave functions, Global optimization algorithms for linearly constrained indefinite quadratic problems, Quasiconjugates of functions, duality relationship between quasiconvex minimization under a reverse convex constraint and quasiconvex maximization under a convex constraint, and applications, Depth-optimized convexity cuts
