Deletion-by-infeasibility rule for DC-constrained global optimization

DOI10.1007/BF02192125zbMath0826.90106OpenAlexW2021803216MaRDI QIDQ1893323

János Fülöp

Publication date: 23 November 1995

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02192125

zbMATH Keywords

global optimizationbranch-and-boundDC-programmingdifferences of convex functionsdeletion-by- infeasibility rule

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• Newton's method for convex programming and Tschebyscheff approximation
• On the convergence of two branch-and-bound algorithms for nonconvex programming problems
• Semi-Infinite Programming: Theory, Methods, and Applications
• The Cutting-Plane Method for Solving Convex Programs
• On an outer approximation concept in global optimization
• A note on the convergence of an algorithm for nonconvex programming problems
• An algorithm for nonconvex programming problems
• The Supporting Hyperplane Method for Unimodal Programming
• An Algorithm for Separable Nonconvex Programming Problems
• Convex Analysis
• An Algorithm for Separable Nonconvex Programming Problems II: Nonconvex Constraints

This page was built for publication: Deletion-by-infeasibility rule for DC-constrained global optimization