Nonlinear Programming: Counterexamples to Two Global Optimization Algorithms
From MaRDI portal
Cited in
(31)- Convergence of a subgradient method for computing the bound norm of matrices
- A branch and bound algorithm for extreme point mathematical programming problems
- Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization
- Convergence of a Tuy-type algorithm for concave minimization subject to linear inequality constraints
- Normal conical algorithm for concave minimization over polytopes
- A new reformulation-linearization technique for bilinear programming problems
- Maximization of linearly constrained posynomials
- Monotone variable-metric algorithm for linearly constrained nonlinear programming
- A reformulation-convexification approach for solving nonconvex quadratic programming problems
- Integral global minimization: Algorithms, implementations and numerical tests
- A convergent conical algorithm with -bisection for concave minimization
- Accelerating convergence of cutting plane algorithms for disjoint bilinear programming
- A decomposition approach for global optimum search in QP, NLP and MINLP problems
- On Non Overlapping Segmentation of the Response Surfaces for Solving Constrained Programming Problems Through Super Convergent Line Series
- Properties of the general quadratic optimization problem and the corresponding linear complementarity problem
- A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts
- 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
- An approach to multi-start clustering for global optimization with non-linear constraints
- Degeneracy removal in cutting plane methods for disjoint bilinear programming
- An extreme-point-ranking algorithm for the extreme-point mathematical programming problem
- On the convergence of cone splitting algorithms with \(\omega\)-subdivisions
- A dual method for polar cuts in disjoint bilinear programming
- 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
- A successive linear approximation algorithm for the global minimization of a concave quadratic program
- Jointly constrained bilinear programs and related problems: An overview
This page was built for publication: Nonlinear Programming: Counterexamples to Two Global Optimization Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5183286)
