Introduction to global optimization.
From MaRDI portal
Publication:5926546
zbMath0966.90073MaRDI QIDQ5926546
Nguyen Van Thoai, Panos M. Pardalos, Reiner Horst
Publication date: 18 March 2001
Published in: Nonconvex Optimization and Its Applications (Search for Journal in Brave)
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Quadratic programming (90C20) Optimality conditions and duality in mathematical programming (90C46) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)
Related Items (only showing first 100 items - show all)
A new exact algorithm for concave knapsack problems with integer variables ⋮ Cutting angle method – a tool for constrained global optimization ⋮ Complementary Principle, Algorithm, and Complete Solutions to Phase Transitions in Solids Governed by Landau-Ginzburg Equation ⋮ Convergence guarantees for a class of non-convex and non-smooth optimization problems ⋮ A globally convergent algorithm for a class of bilevel nonlinear programming problem ⋮ Approximation and optimization of Darboux type differential inclusions with set-valued boundary conditions ⋮ The Karush-Kuhn-Tucker optimality conditions in multiobjective programming problems with interval-valued objective functions ⋮ Confidence Bands for a Log-Concave Density ⋮ A DIRECT-based approach exploiting local minimizations for the solution of large-scale global optimization problems ⋮ Solving non-monotone equilibrium problems via a DIRECT-type approach ⋮ Solving nonlinearly constrained global optimization problem via an auxiliary function method ⋮ A multi-commodity flow formulation for the generalized pooling problem ⋮ DC Programming Approaches for BMI and QMI Feasibility Problems ⋮ An (α ,β)-Optimal solution concept in Fuzzy Optimization problems ⋮ Global optimization of non-convex piecewise linear regression splines ⋮ Solving the maximum clique problem with symmetric rank-one non-negative matrix approximation ⋮ Constrained, Global Optimization of Unknown Functions with Lipschitz Continuous Gradients ⋮ A supply chain design model with unreliable supply ⋮ Sums of squares polynomial program reformulations for adjustable robust linear optimization problems with separable polynomial decision rules ⋮ A mesh adaptive basin hopping method for the design of circular antenna arrays ⋮ An adaptive univariate global optimization algorithm and its convergence rate for twice continuously differentiable functions ⋮ Granular sieving algorithm for selecting best n$$ n $$ parameters ⋮ Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems ⋮ Mixed integer bilevel optimization with a \(k\)-optimal follower: a hierarchy of bounds ⋮ Global optimization on non-convex two-way interaction truncated linear multivariate adaptive regression splines using mixed integer quadratic programming ⋮ Covering balls and \(\mathcal{HT}\)-\textit{differential} for convex maximization ⋮ Survey of Piecewise Convex Maximization and PCMP over Spherical Sets ⋮ The optimality conditions for optimization problems with fuzzy-valued objective functions ⋮ An exact penalty global optimization approach for mixed-integer programming problems ⋮ Semi-supervised \(k\)-means clustering via DC programming approach ⋮ Global minimization of non-smooth unconstrained problems with filled function ⋮ Globally optimal solutions of max-min systems ⋮ On one-step worst-case optimal trisection in univariate bi-objective Lipschitz optimization ⋮ A reformulation-linearization technique for optimization over simplices ⋮ A new necessary and sufficient global optimality condition for canonical DC problems ⋮ The Karush--Kuhn--Tucker optimality conditions in an optimization problem with interval-valued objective function ⋮ Geometric branch-and-bound methods for constrained global optimization problems ⋮ Some results on augmented Lagrangians in constrained global optimization via image space analysis ⋮ Optimization Models in the Natural Gas Industry ⋮ On the exhaustivity of simplicial partitioning ⋮ A partition-based global optimization algorithm ⋮ A computational approach to non-smooth optimization by diffusion equations ⋮ Exact Algorithms for Distributionally β-Robust Machine Scheduling with Uncertain Processing Times ⋮ Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques ⋮ Optimum component test plans for phased-mission systems ⋮ Globally maximizing the sum of squares of quadratic forms over the unit sphere ⋮ A guide to conic optimisation and its applications ⋮ Global optimization by continuous grasp ⋮ A bilinear reduction based algorithm for solving capacitated multi-item dynamic pricing problems ⋮ A distributed computation algorithm for solving portfolio problems with integer variables ⋮ A neurodynamic approach to zero-one quadratic programming ⋮ A new approach for solving mixed integer DC programs using a continuous relaxation with no integrality gap and smoothing techniques ⋮ Completely positive and copositive program modelling for quadratic optimization problems ⋮ The bounds of feasible space on constrained nonconvex quadratic programming ⋮ Second-Order Cone Programming (SOCP) Techniques for Coordinating Large-Scale Robot Teams in Polygonal Environments ⋮ On optimization over the efficient set in linear multicriteria programming ⋮ Constructing test functions for global optimization using continuous formulations of graph problems ⋮ Canonical Duality Theory: Connections between Nonconvex Mechanics and Global Optimization ⋮ Multivariate McCormick relaxations ⋮ Accelerating method of global optimization for signomial geometric programming ⋮ Linearly constrained global optimization via piecewise-linear approximation ⋮ A simplicial branch-and-bound algorithm conscious of special structures in concave minimization problems ⋮ A sample-path approach to optimal position liquidation ⋮ A solution algorithm for non-convex mixed integer optimization problems with only few continuous variables ⋮ Improved dc programming approaches for solving the quadratic eigenvalue complementarity problem ⋮ A new filled function method for unconstrained global optimization ⋮ Minimum Time Multi-UGV Surveillance ⋮ Robust Track Association and Fusion with Extended Feature Matching ⋮ The Karush-Kuhn-Tucker optimality conditions for multi-objective programming problems with fuzzy-valued objective functions ⋮ Unnamed Item ⋮ Base-stock policies in capacitated assembly systems: Convexity properties ⋮ Frequency-hopping code design for Target detection via optimization theory ⋮ Complete solutions and extremality criteria to polynomial optimization problems ⋮ Planning capacity and safety stocks in a serial production-distribution system with multiple products ⋮ Lower bound improvement and forcing rule for quadratic binary programming ⋮ Global optimization method for maximizing the sum of difference of convex functions ratios over nonconvex region ⋮ Branch and probability bound methods in multi-objective optimization ⋮ Copositivity tests based on the linear complementarity problem ⋮ Dynamic search trajectory methods for global optimization ⋮ On Korenblum convex functions ⋮ New global optimality conditions for nonsmooth DC optimization problems ⋮ Exact SDP reformulations of adjustable robust linear programs with box uncertainties under separable quadratic decision rules via SOS representations of non-negativity ⋮ Geometry and combinatorics of the cutting angle method ⋮ Perfect duality theory and complete solutions to a class of global optimization problems* ⋮ Trust Your Data or Not—StQP Remains StQP: Community Detection via Robust Standard Quadratic Optimization ⋮ Two variations of graph test in double description method ⋮ Solving certain complementarity problems in power markets via convex programming ⋮ Preisach based storage devices and global optimizers ⋮ Monotone Smoothing with Application to Dose-Response Curve ⋮ Quadratic optimization over a discrete pareto set of a multi-objective linear fractional program ⋮ A study on sequential minimal optimization methods for standard quadratic problems ⋮ A branch and bound algorithm for Holder bi-objective optimization. Implementation to multidimensional optimization ⋮ Global optimization of protein-peptide docking by a filling function method ⋮ ON THE ACCURACY OF SOME ABSORBING BOUNDARY CONDITIONS FOR THE SCHRODINGER EQUATION ⋮ On an Asymptotic Property of a Simplicial Statistical Model of Global Optimization ⋮ Optimization of boundary value problems for higher order differential inclusions and duality ⋮ Global maximization of UTA functions in multi-objective optimization ⋮ An outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems ⋮ A dynamic inventory model with supplier selection in a serial supply chain structure ⋮ An efficient global algorithm for indefinite separable quadratic knapsack problems with box constraints
This page was built for publication: Introduction to global optimization.
