Convergence of the (GOP) algorithm for a large class of smooth optimization problems

DOI10.1007/BF01096769zbMath0835.90071OpenAlexW1984539523MaRDI QIDQ1804587

Christodoulos A. Floudas, Wen-bin Liu

Publication date: 15 May 1995

Published in: Journal of Global Optimization (Search for Journal in Brave)

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

zbMATH Keywords

GOP algorithmsmooth mathematical programming

Mathematics Subject Classification ID

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

Related Items

Optimal allocation and processing time decisions on non-identical parallel CNC machines: \(\epsilon\)-constraint approach ⋮ Large-scale standard pooling problems with constrained pools and fixed demands ⋮ Mathematical model for scheduling operations in cascaded continuous processing units ⋮ Lower bound functions for polynomials ⋮ Solving a nonlinear integer program for allocating resources ⋮ Quasiconvex relaxations based on interval arithmetic ⋮ Optimal bases of Gaussians in a Hilbert space: Applications in mathematical signal analysis ⋮ Fuzzy description logics with general t-norms and datatypes ⋮ Generalized primal-relaxed dual approach for global optimization

Cites Work

• Unconstrained and constrained global optimization of polynomial functions in one variable
• New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints
• A remark on the GOP algorithm for global optimization
• Global minimum potential energy conformations of small molecules
• Primal-relaxed dual global optimization approach
• Global optimization for molecular conformation problems
• Generalized primal-relaxed dual approach for global optimization