A note on the convergence of an algorithm for nonconvex programming problems
From MaRDI portal
Publication:3879055
DOI10.1007/BF01581645zbMath0437.90069OpenAlexW2082575373MaRDI QIDQ3879055
Publication date: 1980
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01581645
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Rate of convergence, degree of approximation (41A25)
Related Items
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, Applications of Toland's duality theory to nonconvex 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, On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope, A computational comparison of some branch and bound methods for indefinite quadratic programs, 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, Bisecton by global optimization revisited, On the convexification of nonlinear programming problems: An applications-oriented survey, On the global minimization of concave functions, A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization, Concave minimization via conical partitions and polyhedral outer approximation, Decomposition methods for solving nonconvex quadratic programs via branch and bound
Cites Work
