scientific article
From MaRDI portal
Publication:3997222
zbMath0704.90057MaRDI QIDQ3997222
Publication date: 17 September 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
global optimizationd.c. programmingrelaxationouter approximationbilinear programmingconcavity cutssuccessive approximationLipschitzian optimizationsuccessive partitioncutting methods
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (only showing first 100 items - show all)
A global optimization algorithm for generalized semi-infinite, continuous minimax with coupled constraints and bi-level problems ⋮ A review of recent advances in global optimization ⋮ Modular global optimisation in chemical engineering ⋮ Static and dynamic resource allocation models for recovery of interdependent systems: application to the Deepwater Horizon oil spill ⋮ Global optimization of truss topology with discrete bar areas. II: Implementation and numerical results ⋮ Outcome space range reduction method for global optimization of sum of affine ratios problem ⋮ Adaptive nested optimization scheme for multidimensional global search ⋮ Maximizing for the sum of ratios of two convex functions over a convex set ⋮ Global optimization algorithm for sum of generalized polynomial ratios problem ⋮ Theoretical convergence analysis of a general division-deletion algorithm for solving global search problems ⋮ Truss topology optimization with discrete design variables -- guaranteed global optimality and benchmark examples ⋮ A Newton method for solving continuous multiple material minimum compliance problems ⋮ Unboundedness in reverse convex and concave integer programming ⋮ Piece adding technique for convex maximization problems ⋮ An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs ⋮ Global optima for the Zhou-Rozvany problem ⋮ Optimal configuration of a decentralized, market-driven production/inventory system ⋮ Dynamic analysis for the selection of parameters and initial population, in particle swarm optimization ⋮ Solving a class of low rank d.c. programs via a branch and bound approach: a computational experience ⋮ Globally optimal algorithms for stratified autocalibration ⋮ The directional subdifferential of the difference of two convex functions ⋮ A convergent simplicial algorithm with \(\omega \)-subdivision and \(\omega \)-bisection strategies ⋮ Criteria and dimension reduction of linear multiple criteria optimization problems ⋮ On the relation between concavity cuts and the surrogate dual for convex maximization problems ⋮ Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization ⋮ A global optimization algorithm for sum of quadratic ratios problem with coefficients ⋮ Mathematical and metaheuristic applications in design optimization of steel frame structures: an extensive review ⋮ Criteria for unconstrained global optimization ⋮ Global maximization of a generalized concave multiplicative function ⋮ Generalized semi-infinite programming: a tutorial ⋮ New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability ⋮ Global optimization for special reverse convex programming ⋮ Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms ⋮ An all-linear programming relaxation algorithm for optimizing over the efficient set ⋮ On Nash-Cournot oligopolistic market equilibrium models with concave cost functions ⋮ Solving DC programs using the cutting angle method ⋮ Global optimization of concave functions subject to quadratic constraints: An application in nonlinear bilevel programming ⋮ On the closure of the feasible set in generalized semi-infinite programming ⋮ Level-constrained programming ⋮ A computational comparison of some branch and bound methods for indefinite quadratic programs ⋮ Existence and sum decomposition of vertex polyhedral convex envelopes ⋮ Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods ⋮ What can interval analysis do for global optimization? ⋮ Mathematical programs with a two-dimensional reverse convex constraint ⋮ On solving a d.c. programming problem by a sequence of linear programs ⋮ A new simplicial cover technique in constrained global optimization ⋮ The complementary convex structure in global optimization ⋮ Reduction of indefinite quadratic programs to bilinear programs ⋮ Global optimization of a nonconvex single facility location problem by sequential unconstrained convex minimization ⋮ A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique ⋮ On nonconvex optimization problems with separated nonconvex variables ⋮ An optimality criterion for global quadratic optimization ⋮ Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method ⋮ Nonconvex piecewise linear knapsack problems ⋮ Heuristics and lower bounds for minimizing fuel consumption in hybrid-electrical vehicles ⋮ Convergence qualification of adaptive partition algorithms in global optimization ⋮ Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions ⋮ Degeneracy removal in cutting plane methods for disjoint bilinear programming ⋮ Canonical d. c. programming techniques for solving a convex program with an additional constraint of multiplicative type ⋮ Generalized bilinear programming. I: Models, applications and linear programming relaxation ⋮ A generalized duality and applications ⋮ An outer approximation method for minimizing the product of several convex functions on a convex set ⋮ Multidimensional bisection: the performance and the context ⋮ Nonlinear coordinate transformations for unconstrained optimization. II: Theoretical background ⋮ Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems ⋮ Differentiable McCormick relaxations ⋮ A global optimization approach for solving the convex multiplicative programming problem ⋮ An application of Lipschitzian global optimization to product design ⋮ Polyhedral annexation, dualization and dimension reduction technique in global optimization ⋮ A parametric successive underestimation method for convex multiplicative programming problems ⋮ An algorithm for solving convex programs with an additional convex- concave constraint ⋮ Minimization of a quasi-concave function over an efficient set ⋮ A new reformulation-linearization technique for bilinear programming problems ⋮ An approach to constrained global optimization based on exact penalty functions ⋮ Attractive force search algorithm for piecewise convex maximization problems ⋮ Some further duality theorems for optimization problems with reverse convex constraint sets ⋮ Compressor scheduling in oil fields. Piecewise-linear formulation, valid inequalities, and computational analysis ⋮ A global optimization approach for the linear two-level program ⋮ Calculation of bounds on variables satisfying nonlinear inequality constraints ⋮ Relaxing the optimality conditions of box QP ⋮ An integral function and vector sequence method for unconstrained global optimization ⋮ Alternating local search based VNS for linear classification ⋮ Piecewise-linear approximations of multidimensional functions ⋮ Global optimization of nonlinear sum of ratios problem ⋮ Maximization of generalized convex functionals in locally convex spaces. ⋮ Discretization and resolution of the \((r| X_ p)\)-medianoid problem involving quality criteria. ⋮ On the global optimization of sums of linear fractional functions over a convex set ⋮ A fast memoryless interval-based algorithm for global optimization ⋮ Heuristic algorithms for the general nonlinear separable knapsack problem ⋮ Branch-and-bound outer approximation algorithm for sum-of-ratios fractional programs ⋮ A branch and reduce approach for solving a class of low rank d.c. programs ⋮ Convergent Lagrangian and domain cut method for nonlinear knapsack problems ⋮ On the subdifferentiability of the difference of two functions and local minimization ⋮ Conditions for boundedness in concave programming under reverse convex and convex constraints ⋮ Problem-method classification in optimization and control ⋮ Tight convex underestimators for \({{\mathcal C}^2}\)-continuous problems. I: Univariate functions ⋮ Tight convex underestimators for \({\mathcal{C}^2}\)-continuous problems. II: Multivariate functions ⋮ On generalization performance and non-convex optimization of extended \(\nu \)-support vector machine ⋮ Global optimization from concave minimization to concave mixed variational inequality ⋮ Concave minimization via conical partitions and polyhedral outer approximation
This page was built for publication:
