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
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 ⋮ Deterministic methods in constrained global optimization: Some recent advances and new fields of application ⋮ Algorithms to solve some problems of concave programming with linear constraints ⋮ Decision-making based on approximate and smoothed Pareto curves ⋮ A simplicial branch and bound duality-bounds algorithm to linear multiplicative programming ⋮ Global optimization issues in deep network regression: an overview ⋮ A method of acceleration for a class of multiplicative programming problems with exponent ⋮ A DIRECT-based approach exploiting local minimizations for the solution of large-scale global optimization problems ⋮ The DTC (difference of tangentially convex functions) programming: optimality conditions ⋮ An efficient algorithm for globally minimizing sum of quadratic ratios problem with nonconvex quadratic constraints ⋮ On solving general reverse convex programming problems by a sequence of linear programs and line searches ⋮ Valid Inequalities for Separable Concave Constraints with Indicator Variables ⋮ Finding all solutions of nonlinearly constrained systems of equations ⋮ A d.c. optimization method for single facility location problems ⋮ A branch-and-bound algorithm for bound constrained optimization problems without derivatives ⋮ On some connections among variational inequalities, combinatorial and continuous optimization ⋮ An intelligent decision support system for assisting industrial wastewater management ⋮ New LP bound in multivariate Lipschitz optimization: Theory and applications ⋮ Quasidifferentiability in nonsmooth, nonconvex mechanics ⋮ Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem ⋮ A generalized karush-kuhn-tucki optimality condition without constraint qualification using tl approximate subdifferential ⋮ A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes ⋮ \(\alpha BB\): A global optimization method for general constrained nonconvex problems ⋮ Global optimization for the biaffine matrix inequality problem ⋮ An algorithm for solving global optimization problems with nonlinear constraints ⋮ Integral global minimization: Algorithms, implementations and numerical tests ⋮ Dual approach to minimization on the set of Pareto-optimal solutions ⋮ Linearly constrained global minimization of functions with concave minorants ⋮ Second-order scenario approximation and refinement in optimization under uncertainty ⋮ An improved univariate global optimization algorithm with improved linear lower bounding functions ⋮ A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables ⋮ Analytical solutions to the optimization of a quadratic cost function subject to linear and quadratic equality constraints ⋮ Solvability theorems for classes of difference convex functions ⋮ A branch-and-reduce approach to global optimization ⋮ Characterizing global optimality for DC optimization problems under convex inequality constraints ⋮ On convex relaxations for quadratically constrained quadratic programming ⋮ Tight convex relaxations for the expansion planning problem ⋮ Value-at-risk optimization using the difference of convex algorithm ⋮ A framework for optimization under ambiguity ⋮ Novel approaches to the discrimination problem ⋮ Beyond canonical dc-optimization: the single reverse polar problem ⋮ A note on maxmin problem ⋮ A global optimization algorithm for solving a four-person game ⋮ Global optimality conditions and exact penalization ⋮ Convergence conditions and numerical comparison of global optimization methods based on dimensionality reduction schemes ⋮ A practical but rigorous approach to sum-of-ratios optimization in geometric applications ⋮ Survey of Piecewise Convex Maximization and PCMP over Spherical Sets ⋮ Convex and concave envelopes of artificial neural network activation functions for deterministic global optimization ⋮ On the relation between the extended supporting hyperplane algorithm and Kelley's cutting plane algorithm ⋮ A heuristic algorithm for a chance constrained stochastic program ⋮ Some results on augmented Lagrangians in constrained global optimization via image space analysis ⋮ Optimal estimator design for LTI systems with bounded noises, disturbances, and nonlinearities ⋮ Global optimization for max-plus linear systems and applications in distributed systems ⋮ A branch-and-bound algorithm embedded with DCA for DC programming ⋮ Using conical partition to globally maximizing the nonlinear sum of ratios ⋮ On computational search for optimistic solutions in bilevel problems ⋮ A partition-based global optimization algorithm ⋮ A local search method for continuous global optimization ⋮ Methods of embedding-cutting off in problems of mathematical programming ⋮ Some old traditions in mathematics and in mathematical education ⋮ Lipschitz minorants of Brownian motion and Lévy processes ⋮ A combined cutting-stock and lot-sizing problem ⋮ Computationally efficient approach for solving lexicographic multicriteria optimization problems ⋮ Maximization of a PSD quadratic form and factorization ⋮ Biconvex sets and optimization with biconvex functions: a survey and extensions ⋮ Weber problems with mixed distances and regional demand ⋮ Solving sum of ratios fractional programs via concave minimization ⋮ A new concave reformulation and its application in solving DC programming globally under uncertain environment ⋮ How to solve a semi-infinite optimization problem ⋮ A simplicial branch-and-bound algorithm conscious of special structures in concave minimization problems ⋮ Minimizing the sum of a convex function and a specially structured nonconvex function ⋮ The complexity of a special convex programming problem connected with nonlinear optimization ⋮ Convergence of control performance by unfalsification of models?levels of confidence ⋮ A convergent conical algorithm with \(\omega \)-bisection for concave minimization ⋮ Improving the efficiency of DC global optimization methods by improving the DC representation of the objective function ⋮ An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs ⋮ A note on adapting methods for continuous global optimization to the discrete case ⋮ Minimum concave-cost network flow problems: Applications, complexity, and algorithms ⋮ Unnamed Item ⋮ A jointly constrained bilinear programming method for solving generalized Cournot–Pareto models ⋮ Global optimization algorithm for a generalized linear multiplicative programming ⋮ A global optimization approach to fractional optimal control ⋮ On tackling reverse convex constraints for non-overlapping of unequal circles ⋮ Linearization of McCormick relaxations and hybridization with the auxiliary variable method ⋮ Convex quadratic underestimation and Branch and Bound for univariate global optimization with one nonconvex constraint ⋮ An algorithm and new penalties for concave integer minimization over a polyhedron ⋮ Krasnoselski-Mann-type inertial method for solving split generalized mixed equilibrium and hierarchical fixed point problems ⋮ Lagrangian duality of concave minimization subject to linear constraints and an additional facial reverse convex constraint ⋮ Second-order sufficient optimality conditions for local and global nonlinear programming ⋮ Computational experience using an edge search algorithm for linear reverse convex programs ⋮ Generalized primal-relaxed dual approach for global optimization ⋮ A squared-euclidean distance location-allocation problem ⋮ An effective global optimization algorithm for quadratic programs with quadratic constraints ⋮ A branch and bound algorithm to globally solve the sum of several linear ratios ⋮ A deterministic global optimization algorithm for generalized geometric programming ⋮ On the mixed integer signomial programming problems ⋮ (\(\epsilon\)-)efficiency in difference vector optimization ⋮ Computing the nadir point for multiobjective discrete optimization problems ⋮ Global maximization of UTA functions in multi-objective optimization ⋮ Global optimization method for linear multiplicative programming ⋮ Univariate parameterization for global optimization of mixed-integer polynomial problems ⋮ Finding the principal points of a random variable ⋮ Unnamed Item ⋮ Deterministic global optimization for nonlinear model predictive control of hybrid dynamic systems ⋮ ODE Analysis of Biological Systems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A mixed-integer linear programming reduction of disjoint bilinear programs via symbolic variable elimination ⋮ Global optimization method with numerically calculated function derivatives ⋮ An efficient solution method for rank two quasiconcave minimization problems ⋮ On geometry and convergence of a class of simplicial covers ⋮ Subdomain separability in global optimization ⋮ Duality and optimality conditions for reverse convex programs via a convex decomposition ⋮ Smooth representation of a parametric polyhedral convex set with application to sensitivity in optimization ⋮ A New Composite Algorithm for Clustering Problems ⋮ Robust stability analysis of systems with real parametric uncertainty: A global optimization approach ⋮ On Hopf's formula for lipschitz solutions of the cauchy problem for Hamilton-Jacobi equations ⋮ SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework ⋮ Optimization over the efficient set ⋮ On measuring the inefficiency with the inner-product norm in data envelopment analysis ⋮ Integrated capacity, demand, and production planning with subcontracting and overtime options ⋮ Base-stock policies in capacitated assembly systems: Convexity properties ⋮ Maximizing the ratio of two convex functions over a convex set ⋮ On the calculation of a feasible point of a nonconvex set: pathfollowing with jumps ⋮ A direct search variant of the simulated annealing algorithm for optimization involving continuous variables ⋮ Global optimization algorithm for the nonlinear sum of ratios problem ⋮ Intersection cuts for nonlinear integer programming: convexification techniques for structured sets ⋮ On computational search for Nash equilibrium in hexamatrix games ⋮ Inscribed ball and enclosing box methods for the convex maximization problem ⋮ On the implementation and strengthening of intersection cuts for QCQPs ⋮ A specially structured nonlinear integer resource allocation problem ⋮ Dual Randomized Coordinate Descent Method for Solving a Class of Nonconvex Problems ⋮ Comments on: Algorithms for linear programming with linear complementarity constraints ⋮ Multidimensional global optimization using numerical estimates of objective function derivatives ⋮ Solution of a non-linear programming problem with quadratic functions ⋮ Calculating a minimal sphere containing a polytope defined by a system of linear inequalities ⋮ Application of Bayesian approach to numerical methods of global and stochastic optimization ⋮ Linear programs with an additional rank two reverse convex constraint ⋮ A finite concave minimization algorithm using branch and bound and neighbor generation ⋮ On the role of continuously differentiable exact penalty functions in constrained global optimization ⋮ Chebyshev approximation of a point set by a straight line ⋮ A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron ⋮ An algorithm for solving general D. C. programming problems ⋮ Branch-and-bound decomposition approach for solving quasiconvex-concave programs ⋮ Convex programs with an additional constraint on the product of several convex functions ⋮ Decomposition based and branch and bound global optimization approaches for the phase equilibrium problem ⋮ Global optimization in biology and medicine ⋮ Combinatorial algorithms for some 1-facility median problems in the plane ⋮ Constraint decomposition algorithms in global optimization ⋮ Topographical multilevel single linkage ⋮ Global optimization conditions for certain nonconvex minimization problems ⋮ Finding maximum likelihood estimators for the three-parameter Weibull distribution ⋮ On the construction of test problems for concave minimization algorithms ⋮ Some outer approximation methods for semi-infinite optimization problems ⋮ A global optimization algorithm for linear fractional and bilinear programs ⋮ A method for solving d.c. programming problems. Application to fuel mixture nonconvex optimization problem ⋮ Minimum-volume ellipsoids containing compact sets: Application to parameter bounding ⋮ Decomposition methods for solving a class of nonconvex programming problems dealing with bilinear and quadratic functions ⋮ A relaxation method for nonconvex quadratically constrained quadratic programs ⋮ Deletion-by-infeasibility rule for DC-constrained global optimization ⋮ Statistical approximations for recourse constrained stochastic programs ⋮ \(\gamma\)-subdifferential and \(\gamma\)-convexity of functions on a normed space ⋮ Extremal problems on complements of convex sets ⋮ Capacity planning in networks of queues with manufacturing applications ⋮ Bilevel programming for generating discrete representations in multiobjective optimization ⋮ Verified solution of large systems and global optimization problems ⋮ D.C. representability of closed sets in reflexive Banach spaces and applications to optimization problems ⋮ Nonconvex optimization over a polytope using generalized capacity improvement ⋮ Minimizing a linear multiplicative-type function under network flow constraints ⋮ Multiplicative programming problems: Analysis and efficient point search heuristic ⋮ Characterization and generation of \(\alpha\)-dense curves ⋮ Levels sets infimal convolution and level addition ⋮ Formulation assistance for global optimization problems ⋮ Global optimization of MIQCPs with dynamic piecewise relaxations ⋮ Application of stochastic global optimization algorithms to practical problems ⋮ Global optimality test for maximin solution of bilevel linear programming with ambiguous lower-level objective function ⋮ An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver ⋮ Global optimization and multi knapsack: a percolation algorithm. ⋮ Globalizer: a novel supercomputer software system for solving time-consuming global optimization problems ⋮ Efficient multicriterial optimization based on intensive reuse of search information ⋮ A vector linear programming approach for certain global optimization problems ⋮ A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case ⋮ Linear multiplicative programming ⋮ An exact solution method for reliability optimization in complex systems ⋮ Efficient computation of the Hausdorff distance between polytopes by exterior random covering ⋮ Second-order global optimality conditions for optimization problems ⋮ Global optimization of generalized geometric programming ⋮ Convex envelopes for edge-concave functions ⋮ A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs ⋮ Design of planar articulated mechanisms using branch and bound ⋮ Conical partition algorithm for maximizing the sum of dc ratios ⋮ A software system for multiextremal optimization ⋮ The linear complementarity problem as a separable bilinear program ⋮ Efficient algorithms for solving certain nonconvex programs dealing with the product of two affine fractional functions ⋮ Set inversion via interval analysis for nonlinear bounded-error estimation ⋮ Cutting angle methods in global optimization ⋮ A multi-local optimization algorithm ⋮ Generalized bilinear programming: An application in farm management ⋮ Finding robust solutions for product design problems ⋮ A complementarity approach to a quasistatic multi-rigid-body contact problem ⋮ A formula on the conjugate of the max of a convex functions and a concave function ⋮ Subdivision of simplices relative to a cutting plane and finite concave minimization ⋮ Capacity planning in manufacturing and computer networks ⋮ A low-rank bilinear programming approach for sub-optimal solution of the quadratic assignment problem ⋮ Nonlinear programming for multiperiod capacity planning in a manufacturing system ⋮ Weber problems with alternative transportation systems ⋮ Global one-dimensional optimization using smooth auxiliary functions ⋮ Second-order global optimality conditions for convex composite optimization ⋮ A branch and bound method for stochastic global optimization ⋮ Optimization over the efficient set of a parametric multiple objective linear programming problem ⋮ An approximate approach of global optimization for polynomial programming problems ⋮ On the posynomial fractional programming problems ⋮ Extensions of Dinkelbach's algorithm for solving nonlinear fractional programming problems ⋮ Optimal and near optimal quantization of integrable functions. ⋮ Parallel computing in nonconvex programming ⋮ A penalty function approach for solving bi-level linear programs ⋮ New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints ⋮ Experiments using interval analysis for solving a circuit design problem ⋮ A new version of Farkas' lemma and global convex maximization ⋮ The nonlinear knapsack problem - algorithms and applications ⋮ A partial cooperation model for non-unique linear two-level decision problems ⋮ A finite algorithm for solving general quadratic problems ⋮ Global minimization of a generalized convex multiplicative function ⋮ Image space analysis of generalized fractional programs ⋮ The simplex method as a global optimizer: A \(C\)-programming perspective ⋮ Globally determining a minimum-area rectangle enclosing the projection of a higher-dimensional set ⋮ A quasiconcave minimization method for solving linear two-level programs ⋮ Optimization methods for computing global minima of nonconvex potential energy functions ⋮ Global minimum potential energy conformations of small molecules ⋮ A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set ⋮ Conical algorithm for the global minimization of linearly constrained decomposable concave minimization problems ⋮ Primal-relaxed dual global optimization approach ⋮ Optimization over the efficient set: Four special cases ⋮ A generalized Dantzig-Wolfe decomposition principle for a class of nonconvex programming problems ⋮ A priority measure in interval methods for constrained global optimization
