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

DOI10.1007/BF02192125MaRDI QIDQ1893323zbMATH OpenOpenAlexFDO

Authors 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

branch-and-boundDC-programmingdeletion-by- infeasibility ruledifferences of convex functionsglobal optimization

Mathematics Subject Classification ID

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

Recommendations

• Characterizing global optimality for DC optimization problems under convex inequality constraints
• Deletion presolve for accelerating infeasibility diagnosis in optimization models
• Optimality conditions in DC-constrained optimization
• Non-smooth DC-constrained optimization: constraint qualification and minimizing methodologies
• Constraint deletion strategy in the inertia-controlling quadratic programming method
• Global optimization for D.C. multiplicative programming
• Global and local search methods for D.C. constrained problems
• Global Optimization and Constraint Satisfaction
• scientific article; zbMATH DE number 6311514
• On a global search in D.C. optimization problems

Cites work

• A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
• A note on the convergence of an algorithm for nonconvex programming problems
• An algorithm for nonconvex programming problems
• An Algorithm for Separable Nonconvex Programming Problems
• An Algorithm for Separable Nonconvex Programming Problems II: Nonconvex Constraints
• Convex Analysis
• Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization
• scientific article; zbMATH DE number 3950216 (Why is no real title available?)
• scientific article; zbMATH DE number 47153 (Why is no real title available?)
• Newton's method for convex programming and Tschebyscheff approximation
• On an outer approximation concept in global optimization
• 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
• The Supporting Hyperplane Method for Unimodal Programming

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1893323)