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

DOI10.1007/BF01096769MaRDI QIDQ1804587zbMATH OpenOpenAlexFDO

Authors Wenbin Liu, Christodoulos A. Floudas

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)

Cites work

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

Cited in

(9)

• Mathematical model for scheduling operations in cascaded continuous processing units
• Lower bound functions for polynomials
• Optimal allocation and processing time decisions on non-identical parallel CNC machines: \(\epsilon\)-constraint approach
• Solving a nonlinear integer program for allocating resources
• 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
• Quasiconvex relaxations based on interval arithmetic
• Large-scale standard pooling problems with constrained pools and fixed demands

This page was built for publication: Convergence of the (GOP) algorithm for a large class of smooth optimization problems

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