Introduction to global optimization
From MaRDI portal
Publication:1899195
zbMath0836.90134MaRDI QIDQ1899195
Nguyen Van Thoai, Panos M. Pardalos, Reiner Horst
Publication date: 5 October 1995
Published in: Nonconvex Optimization and Its Applications (Search for Journal in Brave)
90C30: Nonlinear programming
90-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming
Related Items
Difference convex optimization techniques in nonsmooth computational mechanics, Comparative analysis of the cutting angle and simulated annealing methods in global optimization, A Complexity Analysis of Local Search Algorithms in Global Optimization, What is quasiconvex analysis?, A parameter-free filled function for unconstrained global optimization, A gradually descent method for discrete global optimization, Complexity of general continuous minimization problems: a survey, Duality bound method for the general quadratic programming problem with quadratic constraints, On convergence of the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions, Finiteness result for the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions, Generalized quasilinearization for quasilinear parabolic equations with nonlinearities of DC type, Constrained global optimization of expensive black box functions using radial basis functions, A gradient-related algorithm with inexact line searches, On the solution of NP-hard linear complementarity problems, Convergence and application of a decomposition method using duality bounds for nonconvex global optimization, A new linearization technique for multi-quadratic 0-1 programming problems., Duality theory in fuzzy mathematical programming problems with fuzzy coefficients, Solving planning and design problems in the process industry using mixed integer and global optimization, Interval methods for verifying structural optimality of circle packing configurations in the unit square, Reverse convex problems: an approach based on optimality conditions, Unification of filled function and tunnelling function in global optimization, A integral filter algorithm for unconstrained global optimization, Global maximization of a generalized concave multiplicative function, The semi-continuous quadratic mixture design problem: description and branch-and-bound approach, A convex analysis approach for convex multiplicative programming, A simplicial branch and duality bound algorithm for the sum of convex-convex ratios problem, Solving knapsack problems with \(S\)-curve return functions, Detecting critical nodes in sparse graphs, On Tikhonov's reciprocity principle and optimality conditions in d. c. optimization, Utility function programs and optimization over the efficient set in multiple-objective decision making, Lagrange duality and partitioning techniques in nonconvex global optimization, Necessary and sufficient global optimality conditions for convex maximization revisited, On the complexity of approximating a KKT point of quadratic programming, Applications of interval arithmetic in non-smooth global optimization, Subdivision, sampling, and initialization strategies for simplical branch and bound in global optimization., Global optimization based on a statistical model and simplicial partitioning., Least squares splines with free knots: Global optimization approach., Computability on continuous, lower semi-continuous and upper semi-continuous real functions, Recent developments and trends in global optimization, Evidence and credibility: Full Bayesian signifiance test for precise hypotheses, Lagrangian decomposition of block-separable mixed-integer all-quadratic programs, The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems, A branch and bound algorithm for solving a class of D-C programming, The linear complementarity problem as a separable bilinear program, Value-estimation function method for constrained global optimization, Subdivision of simplices relative to a cutting plane and finite concave minimization, Maximizing a concave function over the efficient or weakly-efficient set, Combination between global and local methods for solving an optimization problem over the efficient set, The controlled estimation method in the multiobjective linear fractional problem, Finding all solutions of nonlinearly constrained systems of equations, A new algorithm for solving the general quadratic programming problem, Linearly constrained global minimization of functions with concave minorants, DC programming: overview., A class of optimization problems over the efficient set of a multiple criteria nonlinear programming problem, A filled function method for global optimization, Simple transformation functions for finding better minima, The joint replenishment problem with variable production costs, An extension of gap functions for a system of vector equilibrium problems with applications to optimization problems, Adaptive extremal optimization by detrended fluctuation analysis, Two level minimization in multidimensional scaling, A global minimization algorithm for Lipschitz functions, Solving 0-1 programming problems by a penalty approach., Solving fractional problems with dynamic multistart improving hit-and-run, Mean-variance portfolio optimal problem under concave transaction cost, A soft approach for hard continuous optimization, On memory gradient method with trust region for unconstrained optimization, Fractional programming with convex quadratic forms and functions, A branch-reduce-cut algorithm for the global optimization of probabilistically constrained linear programs, Second-order sufficient optimality conditions for local and global nonlinear programming, A new rectangle branch-and-reduce approach for solving nonconvex quadratic programming problems, On a nonseparable convex maximization problem with continuous Knapsack constraints, Solving sum-of-ratios fractional programs using efficient points, Automatic loop shaping in QFT using hybrid optimization and constraint propagation techniques, Parallel Branch and Bound Algorithm with Combination of Lipschitz Bounds over Multidimensional Simplices for Multicore Computers
