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
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, Utility/privacy trade-off as regularized optimal transport, Global descent method for constrained continuous global optimization, \texttt{mplrs}: a scalable parallel vertex/facet enumeration code, Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods, Bounding duality gap for separable problems with linear constraints, DC programming techniques for solving a class of nonlinear bilevel programs, New results on the equivalence between zero-one programming and continuous concave programming, An efficient global algorithm for a class of indefinite separable quadratic programs, A review of recent advances in global optimization, Autonomous agents modelling other agents: a comprehensive survey and open problems, Computing tight bounds via piecewise linear functions through the example of circle cutting problems, A hierarchical approach for sparse source blind signal separation problem, Generating cutting planes for the semidefinite relaxation of quadratic programs, Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals, Improved strategies for radial basis function methods for global optimization, Singular optimal control by minimizer flows, A new exclusion test for finding the global minimum, A global optimization algorithm for sum of linear ratios problem, A reformulation framework for global optimization, On the global solution of multi-parametric mixed integer linear programming problems, An edge-concave underestimator for the global optimization of twice-differentiable nonconvex problems, Sign reversion approach to concave minimization problems, Challenges of continuous global optimization in molecular structure prediction, An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs, The Karush-Kuhn-Tucker optimality conditions for the fuzzy optimization problems in the quotient space of fuzzy numbers, Parallel radial basis function methods for the global optimization of expensive functions, Global optimization over a box via canonical dual function, Dynamic analysis for the selection of parameters and initial population, in particle swarm optimization, The theoretical and empirical rate of convergence for geometric branch-and-bound methods, The approximation algorithm for solving a sort of non-smooth programming, Global optimization using a genetic algorithm with hierarchically structured population, A hybrid metaheuristic approach to solving the UBQP problem, Continuous piecewise linear delta-approximations for bivariate and multivariate functions, Reverse convex programming approach in the space of extreme criteria for optimization over efficient sets, On the worst-case optimal multi-objective global optimization, Multi-resource allocation in stochastic project scheduling, Fast Gaussian kernel learning for classification tasks based on specially structured global optimization, On box constrained concave quadratic optimization, A comparative note on the relaxation algorithms for the linear semi-infinite feasibility problem, Numerical solution for bounding feasible point sets, An efficient DC programming approach for portfolio decision with higher moments, Continuous piecewise linear delta-approximations for univariate functions: computing minimal breakpoint systems, Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints, Continuous reformulations for zero-one programming problems, The directional subdifferential of the difference of two convex functions, Lower bound functions for polynomials, Stochastic global optimization as a filtering problem, On global optimality conditions and cutting plane algorithms, Criteria and dimension reduction of linear multiple criteria optimization problems, Stability properties of the Tikhonov regularization for nonmonotone inclusions, Adaptation of a one-step worst-case optimal univariate algorithm of bi-objective Lipschitz optimization to multidimensional problems, On linearization techniques for budget-constrained binary quadratic programming problems, Modeling of uplink power control for cognitive radio networks: cooperative and noncooperative, On linear programs with linear complementarity constraints, A modified DIviding RECTangles algorithm for a problem in astrophysics, Inexact Halpern-type proximal point algorithm, Approximation and optimization of higher order discrete and differential inclusions, A global optimization algorithm for signomial geometric programming problem, The spherical constraint in Boolean quadratic programs, The directed and Rubinov subdifferentials of quasidifferentiable functions. I: Definition and examples, Vector multivariate subdivision schemes: comparison of spectral methods for their regularity analysis, Flow search approach and new bounds for the \(m\)-step linear conjugate gradient algorithm, A one-step worst-case optimal algorithm for bi-objective univariate optimization, Gradient surfing: a new deterministic approach for low-dimensional global optimization, Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development, Visualization of a statistical approximation of the Pareto front, Optimization methods for mixed integer weakly concave programming problems, A branch-and-cut algorithm for a class of sum-of-ratios problems, A filling function method for unconstrained global optimization, Optimizing fiber orientation in fiber-reinforced materials using efficient upscaling, Optimality conditions for linear programming problems with fuzzy coefficients, MINQ8: general definite and bound constrained indefinite quadratic programming, Some feasibility sampling procedures in interval methods for constrained global optimization, An exact method for a discrete multiobjective linear fractional optimization, Finding optimal vaccination strategies under parameter uncertainty using stochastic program\-ming, The design of optimum component test plans for system reliability, Pareto set approximation by the method of adjustable weights and successive lexicographic goal programming, An approach to constrained global optimization based on exact penalty functions, Bisecton by global optimization revisited, Theoretical rate of convergence for interval inclusion functions, On global unconstrained minimization of the difference of polyhedral functions, Coerciveness property for conical nonsmooth functionals, Piecewise-linear approximations of multidimensional functions, Global descent methods for unconstrained global optimization, Integrating design and production planning considerations in multi-bay manufacturing facility layout, Exact penalty functions for nonlinear integer programming problems, Robust resource allocations in temporal networks, Simplicial branch-and-reduce algorithm for convex programs with a multiplicative constraint, Filter-based DIRECT method for constrained global optimization, A new branch and bound method with pretreatment for the binary quadratic programming, A dynamic game approach to distributionally robust safety specifications for stochastic systems, Dictionary learning for fast classification based on soft-thresholding, Efficient semidefinite branch-and-cut for MAP-MRF inference, On the subdifferentiability of the difference of two functions and local minimization, Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming, Algorithms for nonnegative matrix and tensor factorizations: a unified view based on block coordinate descent framework, Tight convex underestimators for \({{\mathcal C}^2}\)-continuous problems. I: Univariate functions, Tight convex underestimators for \({\mathcal{C}^2}\)-continuous problems. II: Multivariate functions, Solutions and optimality criteria for nonconvex constrained global optimization problems with connections between canonical and Lagrangian duality, The optimality conditions for optimization problems with convex constraints and multiple fuzzy-valued objective functions, On optimal zero-preserving corrections for inconsistent linear systems
