scientific article; zbMATH DE number 914364
From MaRDI portal
zbMATH Open0867.90105MaRDI QIDQ4889854FDOQ4889854
Authors: Hoang Tuy, Reiner Horst 
Publication date: 7 August 1996
Title of this publication is not available (Why is that?)
Recommendations
- scientific article; zbMATH DE number 47153
- Introduction to global optimization.
- A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
- Deterministic methods in constrained global optimization: Some recent advances and new fields of application
- Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Cited In (only showing first 100 items - show all)
- Globally-biased disimpl algorithm for expensive global optimization
- Rank-one LMI approach to simultaneous stabilization of linear systems.
- Global optimization based on novel heuristics, low-discrepancy sequences and genetic algorithms
- Solving the median problem with continuous demand on a network
- MrDIRECT: a multilevel robust DIRECT algorithm for global optimization problems
- On local search in d.c. optimization problems
- A univariate global search working with a set of Lipschitz constants for the first derivative
- Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision
- DC programming: overview.
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. Part II: Convergence analysis and numerical results
- Finding roots of nonlinear equations using the method of concave support functions
- Variations and extension of the convex-concave procedure
- Global solution of bilevel programs with a nonconvex inner program
- Global optimization of bilinear programs with a multiparametric disaggregation technique
- A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems
- Computational optimization of the vortex manufacturing of advanced materials
- A generalization of \(\omega \)-subdivision ensuring convergence of the simplicial algorithm
- Global optimization of explicit strong-stability-preserving Runge-Kutta methods
- Nonlinear optimization with GAMS /LGO
- Necessary and sufficient global optimality conditions for convex maximization revisited
- An algorithm for nonlinear optimization problems with binary variables
- On computing ELECTRE's credibility indices under partial information
- Solving dynamic public insurance games with endogenous agent distributions: theory and computational approximation
- Reformulations in Mathematical Programming: Definitions and Systematics
- On convergence of the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions
- Global optimization with spline constraints: a new branch-and-bound method based on B-splines
- Use of branch and bound method for search of an equilibrium in potential Cournot model
- On the convergence of cone splitting algorithms with \(\omega\)-subdivisions
- Sign reversion approach to concave minimization problems
- On a stochastic bilevel programming problem
- The big cube small cube solution method for multidimensional facility location problems
- Deterministic global optimization. Geometric branch-and-bound methods and their applications
- Title not available (Why is that?)
- Explicit convex and concave envelopes through polyhedral subdivisions
- Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON
- A lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures
- Dominating sets for convex functions with some applications
- Feasible method for generalized semi-infinite programming
- On generalized geometric programming problems with non-positive variables
- Minmax regret location--allocation problem on a network under uncertainty
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Exact penalty and error bounds in DC programming
- A reliable affine relaxation method for global optimization
- Solving planning and design problems in the process industry using mixed integer and global optimization
- Global optimization. From theory to implementation.
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- Computational Study of Local Search Methods for a D.C. Optimization Problem with Inequality Constraints
- A framework for globally optimizing mixed-integer signomial programs
- An extension of branch-and-bound algorithm for solving sum-of-nonlinear-ratios problem
- The impelling function method applied to global optimization
- Hybrid approach for solving multiple-objective linear programs in outcome space
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development
- A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem
- Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of process networks
- GLOMIQO: global mixed-integer quadratic optimizer
- Entropy-like proximal algorithms based on a second-order homogeneous distance function for quasi-convex programming
- Global solution of semi-infinite programs
- Generalized McCormick relaxations
- Discrete tomography by convex--concave regularization and D.C. programming
- A simplicial branch and duality bound algorithm for the sum of convex-convex ratios problem
- Generalized \(\gamma\)-valid cut procedure for concave minimization
- Lipschitz gradients for global optimization in a one-point-based partitioning scheme
- The cluster problem revisited
- A hybrid multiagent approach for global trajectory optimization
- Global optimization problems and domain reduction strategies
- Outlier detection and least trimmed squares approximation using semi-definite programming
- A two-stage robust optimization approach for the mobile facility fleet sizing and routing problem under uncertainty
- Model development and optimization for space engineering: concepts, tools, applications, and perspectives
- Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms
- Robust location transportation problems under uncertain demands
- Portfolio optimization for wealth-dependent risk preferences
- Optimality-based domain reduction for inequality-constrained NLP and MINLP problems
- A deterministic global optimization algorithm
- A bilinear reduction based algorithm for solving capacitated multi-item dynamic pricing problems
- Nonlinear convex and concave relaxations for the solutions of parametric ODEs
- Robust network design in telecommunications under polytope demand uncertainty
- Lifted inequalities for \(0-1\) mixed-integer bilinear covering sets
- Dynamic programming algorithms for multi-stage safety stock optimization
- A local search method for optimization problem with d.c. inequality constraints
- Theoretical treatment of target coverage in wireless sensor networks
- Optimum component test plans for phased-mission systems
- Convergence analysis of Taylor models and McCormick-Taylor models
- Packing equal circles in a square: A deterministic global optimization approach
- The theoretical and empirical rate of convergence for geometric branch-and-bound methods
- Global solution of optimization problems with parameter-embedded linear dynamic systems.
- Optimal exact tests for multiple binary endpoints
- Finding elliptic Fekete points sets: Two numerical solution approaches
- New interval methods for constrained global optimization
- Duality bound method for the general quadratic programming problem with quadratic constraints
- Global optimization of bounded factorable functions with discontinuities
- Convergent upper bounds in global minimization with nonlinear equality constraints
- Hybrid Behavioral-Based Multiobjective Space Trajectory Optimization
- Global optimization of a rank-two nonconvex program
- Linear scaling and the DIRECT algorithm
- Global optimization through a stochastic perturbation of the Polak-Ribière conjugate gradient method
- Deterministic global optimization using space-filling curves and multiple estimates of Lipschitz and Hölder constants
- Equidistant and \(D\)-optimal designs for parameters of Ornstein-Uhlenbeck process
- Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints
- A parametric approach for solving a class of generalized quadratic-transformable rank-two nonconvex programs
- Solving a class of multiplicative programs with 0-1 knapsack constraints
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4889854)
