Publication:4889854
From MaRDI portal
zbMath0867.90105MaRDI QIDQ4889854
Publication date: 7 August 1996
65K05: Numerical mathematical programming methods
90C30: Nonlinear programming
90-02: Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming
Related Items
Unnamed Item, ON THE PROJECTION OF THE EFFICIENT SET AND POTENTIAL APPLICATIONS, On convergence of "divide the best" global optimization algorithms, Global optimization of explicit strong-stability-preserving Runge-Kutta methods, Optimization of the norm of a vector-valued DC function and applications, Duality bound method for the general quadratic programming problem with quadratic constraints, Inner approximation method for a reverse convex programming problem, On convergence of the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions, Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms, LMI approximations for the radius of the intersection of ellipsoids: Survey., Finding elliptic Fekete points sets: Two numerical solution approaches, Biconvex programming approach to optimization over the weakly efficient set of a multiple objective affine fractional problem, On the convergence of cone splitting algorithms with \(\omega\)-subdivisions, Computational optimization of the vortex manufacturing of advanced materials, A class of generalized filled functions with improved computability, A bilinear algorithm for optimizing a linear function over the efficient set of a multiple objective linear programming problem, Probabilistic subproblem selection in branch-and-bound algorithms, An inner approximation method incorporating with a penalty function method for a reverse convex programming problem, Convergence and application of a decomposition method using duality bounds for nonconvex global optimization, Global solution of optimization problems with parameter-embedded linear dynamic systems., Proof of convergence for a global optimization algorithm for problems with ordinary differential equations, Logic-based modeling and solution of nonlinear discrete/continuous optimization problems, Solving planning and design problems in the process industry using mixed integer and global optimization, A hybrid multiagent approach for global trajectory optimization, DC programming techniques for solving a class of nonlinear bilevel programs, Univariate global optimization with multiextremal non-differentiable constraints without penalty functions, On generalized geometric programming problems with non-positive variables, Minmax regret location--allocation problem on a network under uncertainty, Existence and computation of short-run equilibria in economic geography, A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem, Entropy-like proximal algorithms based on a second-order homogeneous distance function for quasi-convex programming, Bilevel multiplicative problems: A penalty approach to optimality and a cutting plane based algorithm, A lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures, Equidistant and \(D\)-optimal designs for parameters of Ornstein-Uhlenbeck process, A new global optimization method for univariate constrained twice-differentiable NLP problems, A new constructing auxiliary function method for global optimization, A simplicial branch and duality bound algorithm for the sum of convex-convex ratios problem, Applications of optimization heuristics to estimation and modelling problems, The design of optimum component test plans for system reliability, A local exploration-based differential evolution algorithm for constrained global optimization, Criteria for global minimum of sum of squares in nonlinear regression, Global solution of bilevel programs with a nonconvex inner program, A univariate global search working with a set of Lipschitz constants for the first derivative, Global optimization based on novel heuristics, low-discrepancy sequences and genetic algorithms, Hybrid approach for solving multiple-objective linear programs in outcome space, 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, Dynamic programming algorithms for multi-stage safety stock optimization, Necessary and sufficient global optimality conditions for convex maximization revisited, An integer concave minimization approach for the minimum concave cost capacitated flow problem on networks, Dominating sets for convex functions with some applications, Numerical solution for bounding feasible point sets, Applications of interval arithmetic in non-smooth global optimization, On global optimality conditions and cutting plane algorithms, Simplicially-constrained DC optimization over efficient and weakly efficient sets, A new filled function applied to global optimization., The barrier attribute of filled functions., Outcome-space cutting-plane algorithm for linear multiplicative programming, Comparison of partition evaluation measures in an adaptive partitioning algorithm for global optimization, Rank-one LMI approach to simultaneous stabilization of linear systems., Packing equal circles in a square: A deterministic global optimization approach, The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems, Global solution of semi-infinite programs, Generalized \(\gamma\)-valid cut procedure for concave minimization, The impelling function method applied to global optimization, A computable filled function used for global minimization, An inverse treatment planning model for intensity modulated radiation therapy with dynamic MLC, Fuzzy J-means: a new heuristic for fuzzy clustering, An algebra-based approach for linearly constrained concave minimization, A stochastic approach to global optimization of nonlinear programming problem with many equality constraints, DC programming: overview., Solving a class of multiplicative programs with 0-1 knapsack constraints, A robust algorithm for quadratic optimization under quadratic constraints, A new duality approach to solving concave vector maximization problems, Optimum component test plans for phased-mission systems, A bilinear reduction based algorithm for solving capacitated multi-item dynamic pricing problems, Nonlinear optimization with GAMS /LGO, Algorithms for separable nonlinear least squares with application to modelling time-resolved spectra, Accelerating convergence of cutting plane algorithms for disjoint bilinear programming, On optimization over the efficient set in linear multicriteria programming, Globally tight bounds for almost differentiable functions over polytopes with application to tolerance analysis., New interval methods for constrained global optimization, Two-stage integer programs with stochastic right-hand sides: A superadditive dual approach, A branch-reduce-cut algorithm for the global optimization of probabilistically constrained linear programs, A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems, A class of augmented filled functions, An intelligent genetic algorithm designed for global optimization of multi-minima functions, Discrete tomography by convex--concave regularization and D.C. programming, Minorant methods of stochastic global optimization, Learning parallel portfolios of algorithms, On generalized bisection of 𝑛-simplices, On the hierarchy of γ-valid cuts in global optimization, A validation and verification tool for global optimization solvers, A novel global optimization technique for high dimensional functions, Reformulations in Mathematical Programming: Definitions and Systematics, Hybrid Behavioral-Based Multiobjective Space Trajectory Optimization, Unnamed Item
