scientific article; zbMATH DE number 914364
From MaRDI portal
Publication:4889854
zbMath0867.90105MaRDI QIDQ4889854
Publication date: 7 August 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
Finding roots of nonlinear equations using the method of concave support functions, A generalization of \(\omega \)-subdivision ensuring convergence of the simplicial algorithm, A hybrid multiagent approach for global trajectory optimization, Solving dynamic public insurance games with endogenous agent distributions: theory and computational approximation, On local search in d.c. optimization problems, Global optimization with spline constraints: a new branch-and-bound method based on B-splines, DC programming techniques for solving a class of nonlinear bilevel programs, Towards global bilevel dynamic optimization, Use of branch and bound method for search of an equilibrium in potential Cournot model, Outer approximation method incorporating a quadratic approximation for a DC programming problem, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, Utility function programs and optimization over the efficient set in multiple-objective decision making, Univariate global optimization with multiextremal non-differentiable constraints without penalty functions, On generalized geometric programming problems with non-positive variables, A two-stage robust optimization approach for the mobile facility fleet sizing and routing problem under uncertainty, Minmax regret location--allocation problem on a network under uncertainty, Lagrange duality and partitioning techniques in nonconvex global optimization, Existence and computation of short-run equilibria in economic geography, Dynamic programming algorithms for multi-stage safety stock optimization, Convergence analysis of Taylor models and McCormick-Taylor models, GLOMIQO: global mixed-integer quadratic optimizer, Computation of multiple global optima through chaotic ant swarm, Necessary and sufficient global optimality conditions for convex maximization revisited, Sign reversion approach to concave minimization problems, Feasible method for generalized semi-infinite programming, A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem, An integer concave minimization approach for the minimum concave cost capacitated flow problem on networks, The theoretical and empirical rate of convergence for geometric branch-and-bound methods, Global optimization of bilinear programs with a multiparametric disaggregation technique, A novel non-linear approach to minimal area rectangular packing, A framework for globally optimizing mixed-integer signomial programs, An interval estimator for the unmixing of mixtures with set-based source descriptions, P-algorithm based on a simplicial statistical model of multimodal functions, A parametric approach for solving a class of generalized quadratic-transformable rank-two nonconvex programs, Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of process networks, Dual and bidual problems for a Lipschitz optimization problem based on quasi-conjugation, A hybrid method for quantum global optimization, Exact penalty and error bounds in DC programming, Two-stage quadratic integer programs with stochastic right-hand sides, A deterministic global optimization using smooth diagonal auxiliary functions, Global optimality conditions for cubic minimization problems with cubic constraints, Lipschitz gradients for global optimization in a one-point-based partitioning scheme, A feasible point adaptation of the Blankenship and Falk algorithm for semi-infinite programming, Global minimization of a generalized linear multiplicative programming, Mission-based component testing for series systems, Entropy-like proximal algorithms based on a second-order homogeneous distance function for quasi-convex programming, Branch-and-lift algorithm for deterministic global optimization in nonlinear optimal control, Low dimensional simplex evolution: a new heuristic for global optimization, Generalized McCormick relaxations, Interval methods for model qualification: methodology and advanced application, Bilevel multiplicative problems: A penalty approach to optimality and a cutting plane based algorithm, Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development, Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. Part II: Convergence analysis and numerical results, A penalty approximation method for a semilinear parabolic double obstacle problem, A lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures, Global optimization by multilevel partition, A collision detection approach for maximizing the material utilization, A reliable affine relaxation method for global optimization, Reverse propagation of McCormick relaxations, A penalty approach to a discretized double obstacle problem with derivative constraints, Robust location transportation problems under uncertain demands, Equidistant and \(D\)-optimal designs for parameters of Ornstein-Uhlenbeck process, A new global optimization method for univariate constrained twice-differentiable NLP problems, Global optimization of non-convex generalized disjunctive programs: a review on reformulations and relaxation techniques, Bounds tightening based on optimality conditions for nonconvex box-constrained optimization, A new constructing auxiliary function method for global optimization, Global optimization through a stochastic perturbation of the Polak-Ribière conjugate gradient method, Approximate Bayesian recursive estimation, A simplicial branch and duality bound algorithm for the sum of convex-convex ratios problem, Applications of optimization heuristics to estimation and modelling problems, Three enhancements for optimization-based bound tightening, Simplex particle swarm optimization with arithmetical crossover for solving global optimization problems, Convergence analysis of multivariate McCormick relaxations, The design of optimum component test plans for system reliability, An extension of branch-and-bound algorithm for solving sum-of-nonlinear-ratios problem, Bisecton by global optimization revisited, 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., An augmented Lagrangian fish swarm based method for global optimization, A bilinear algorithm for optimizing a linear function over the efficient set of a multiple objective linear programming problem, Robust network design in telecommunications under polytope demand uncertainty, Probabilistic subproblem selection in branch-and-bound algorithms, An algorithm for nonlinear optimization problems with binary variables, \({{\mathcal {D}(\mathcal {C})}}\)-optimization and robust global optimization, A modified simplicial algorithm for convex maximization based on an extension of \(\omega \)-subdivision, Deterministic global optimization using space-filling curves and multiple estimates of Lipschitz and Hölder constants, The big cube small cube solution method for multidimensional facility location problems, A local exploration-based differential evolution algorithm for constrained global optimization, The cluster problem revisited, Criteria for global minimum of sum of squares in nonlinear regression, Global solution of bilevel programs with a nonconvex inner program, Hybrid approach for solving multiple-objective linear programs in outcome space, On Tikhonov's reciprocity principle and optimality conditions in d. c. optimization, 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, On optimal zero-preserving corrections for inconsistent linear 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, Variations and extension of the convex-concave procedure, Natural gas production network infrastructure development under uncertainty, Packing equal circles in a square: A deterministic global optimization approach, An algebra-based approach for linearly constrained concave minimization, A stochastic approach to global optimization of nonlinear programming problem with many equality constraints, An optimization method for chaotic turbulent flow, The cost of not knowing enough: mixed-integer optimization with implicit Lipschitz nonlinearities, A revision of the rectangular algorithm for a class of DC optimization problems, Global optimization of a rank-two nonconvex program, A robust algorithm for quadratic optimization under quadratic constraints, Global optimization method with dual Lipschitz constant estimates for problems with non-convex constraints, A computational study of exact approaches for the adjustable robust resource-constrained project scheduling problem, Linear scaling and the DIRECT algorithm, Iterative MC-algorithm to solve the global optimization problems, Optimal exact tests for multiple binary endpoints, Convergence-order analysis of branch-and-bound algorithms for constrained problems, New bounding schemes and algorithmic options for the Branch-and-Sandwich algorithm, Trigonometric spline and spectral bounds for the solution of linear time-periodic systems, Global optimization of disjunctive programs, Global optimality conditions in nonconvex optimization, Optimality-based domain reduction for inequality-constrained NLP and MINLP problems, Dominating sets for convex functions with some applications, The cluster problem in constrained global optimization, An optimization algorithm inspired by social creativity systems, Multiobjective nonlinear sum of fractional optimization problems with nonconvex constraints with the use of the duality-based branch and bound algorithm, Deterministic global optimization of process flowsheets in a reduced space using McCormick relaxations, Global optimization of nonlinear least-squares problems by branch-and-bound and optimality constraints, Numerical solution for bounding feasible point sets, On solving the sum-of-ratios problem, Application of the \texttt{DIRECT} algorithm to searching for an optimal \(k\)-partition of the set \(\mathcal {A}\subset \mathbb {R}^n\) and its application to the multiple circle detection problem, A reducibility method for the weak linear bilevel programming problems and a case study in principal-agent, Applications of interval arithmetic in non-smooth global optimization, Domain reduction techniques for global NLP and MINLP optimization, On global optimality conditions and cutting plane algorithms, Image labeling by assignment, A new duality approach to solving concave vector maximization problems, Simplicially-constrained DC optimization over efficient and weakly efficient sets, Explicit convex and concave envelopes through polyhedral subdivisions, Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision, Theoretical treatment of target coverage in wireless sensor networks, Convex and concave relaxations for the parametric solutions of semi-explicit index-one differential-algebraic equations, Optimization methods for box-constrained nonlinear programming problems based on linear transformation and Lagrange interpolating polynomials, Portfolio optimization for wealth-dependent risk preferences, A new filled function applied to global optimization., Global optimization problems and domain reduction strategies, Global optimization in Hilbert space, The barrier attribute of filled functions., DC programming: overview., Solving a class of multiplicative programs with 0-1 knapsack constraints, Reservoir computing for forecasting large spatiotemporal dynamical systems, An effective algorithm for globally solving quadratic programs using parametric linearization technique, A new framework to relax composite functions in nonlinear programs, DC formulations and algorithms for sparse optimization problems, Lifted inequalities for \(0-1\) mixed-integer bilinear covering sets, Simplicial Lipschitz optimization without the Lipschitz constant, Rounding on the standard simplex: regular grids for global optimization, Globally-biased disimpl algorithm for expensive global optimization, Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants, An algorithm of simplicial Lipschitz optimization with the bi-criteria selection of simplices for the bi-section, On convergence rate of a rectangular partition based global optimization algorithm, GOSH: derivative-free global optimization using multi-dimensional space-filling curves, Incremental method for multiple line detection problem -- iterative reweighted approach, Duality-based branch-bound computational algorithm for sum-of-linear-fractional multi-objective optimization problem, Strong valid inequalities for fluence map optimization problem under dose-volume restrictions, The hill detouring method for minimizing hinging hyperplanes functions, A cutting plane method for bilevel linear programming with interval coefficients, A new algorithm for concave quadratic programming, Acceleration procedure for special classes of multi-extremal problems, The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems, Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties, Convergent upper bounds in global minimization with nonlinear equality constraints, A combination of \texttt{RANSAC} and \texttt{DBSCAN} methods for solving the multiple geometrical object detection problem, On tightness and anchoring of McCormick and other relaxations, A generalized Benders decomposition-based branch and cut algorithm for two-stage stochastic programs with nonconvex constraints and mixed-binary first and second stage variables, A scalable global optimization algorithm for stochastic nonlinear programs, Global solution of semi-infinite programs, Underestimation functions for a rank-two partitioning method, A combination of \(k\)-means and \texttt{DBSCAN} algorithm for solving the multiple generalized circle detection problem, Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems, A local search method for optimization problem with d.c. inequality constraints, Generalized \(\gamma\)-valid cut procedure for concave minimization, Steklov regularization and trajectory methods for univariate global optimization, Deterministic global optimization with Gaussian processes embedded, Ordering policies of a deteriorating item in an EOQ model under upstream partial order-quantity-dependent trade credit and downstream full trade credit, Identification of mechanical properties of arteries with certification of global optimality, The impelling function method applied to global optimization, Outcome-space cutting-plane algorithm for linear multiplicative programming, A decomposition method for MINLPs with Lipschitz continuous nonlinearities, On convex lower-level black-box constraints in bilevel optimization with an application to gas market models with chance constraints, Approximating roots of nonlinear systems by \(\alpha\)-dense curves, A derivative-free algorithm for constrained global optimization based on exact penalty functions, A computable filled function used for global minimization, Comparison of partition evaluation measures in an adaptive partitioning algorithm for global optimization, An inverse treatment planning model for intensity modulated radiation therapy with dynamic MLC, Fuzzy J-means: a new heuristic for fuzzy clustering, MrDIRECT: a multilevel robust DIRECT algorithm for global optimization problems, Rank-one LMI approach to simultaneous stabilization of linear systems., Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints, A local search scheme for the inequality-constrained optimal control problem, On generalized surrogate duality in mixed-integer nonlinear programming, On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming, On a stochastic bilevel programming problem, Disjunctive Cuts for Nonconvex MINLP, A Lagrangian heuristic for concave cost facility location problems: the plant location and technology acquisition problem, A Search Algorithm for the Global Extremum of a Discontinuous Function, Using projected cutting planes in the extended cutting plane method, Solving the median problem with continuous demand on a network, ON THE PROJECTION OF THE EFFICIENT SET AND POTENTIAL APPLICATIONS, Strong valid inequalities for orthogonal disjunctions and bilinear covering sets, Learning parallel portfolios of algorithms, A branch-bound cut technique for non-linear fractional multi-objective optimization problems, Cutting Plane Generation through Sparse Principal Component Analysis, On \texttt{MATLAB} experience in accelerating \texttt{DIRECT-GLce} algorithm for constrained global optimization through dynamic data structures and parallelization, Modified DIRECT Algorithm for Scaled Global Optimization Problems, The problems of non-convex quadratic programming related to phased antenna arrays optimization, A successive linear relaxation method for MINLPs with multivariate Lipschitz continuous nonlinearities, Solving linear multiplicative programs via branch-and-bound: a computational experience, Towards global parameter estimation exploiting reduced data sets, Optimising portfolio diversification and dimensionality, A Unified Framework for Pricing in Nonconvex Resource Allocation Games, Recent advances in nonconvex semi-infinite programming: applications and algorithms, Mixed-integer programming techniques for the minimum sum-of-squares clustering problem, Optimization of the optimal value function in problems of convex parametric programming, Open issues and recent advances in DC programming and DCA, On a planar six-neighbor theorem and its application, On the hierarchy of γ-valid cuts in global optimization, Geometric branch-and-bound methods for constrained global optimization problems, Improved convex and concave relaxations of composite bilinear forms, Acceleration of Global Search by Implementing Dual Estimates for Lipschitz Constant, Optimal Planning of Distributed Generation via Nonlinear Optimization and Genetic Algorithms, Unnamed Item, Global optimization of bounded factorable functions with discontinuities, Outlier detection and least trimmed squares approximation using semi-definite programming, Deletion Presolve for Accelerating Infeasibility Diagnosis in Optimization Models, DC Algorithm for Extended Robust Support Vector Machine, Unnamed Item, Relaxations of factorable functions with convex-transformable intermediates, 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, Generating $\alpha $-dense curves in non-convex sets to solve a class of non-smooth constrained global optimization, When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance under Translation, Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON, Global optimization of explicit strong-stability-preserving Runge-Kutta methods, On optimization over the efficient set in linear multicriteria programming, Global Optimization in Practice:State of the Art and Perspectives, Globally tight bounds for almost differentiable functions over polytopes with application to tolerance analysis., 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, New interval methods for constrained global optimization, Biconvex programming approach to optimization over the weakly efficient set of a multiple objective affine fractional problem, Cooperative Control of Multiple Swarms of Mobile Robots with Communication Constraints, The combination stretching function technique with simulated annealing algorithm for global optimization, On the convergence of cone splitting algorithms with \(\omega\)-subdivisions, Computational optimization of the vortex manufacturing of advanced materials, A validation and verification tool for global optimization solvers, 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, On convergence of "divide the best" global optimization algorithms, A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems, A class of generalized filled functions with improved computability, Quadratic Support Functions in Quadratic Bilevel Problems, On the Performance of NLP Solvers Within Global MINLP Solvers, A class of augmented filled functions, An intelligent genetic algorithm designed for global optimization of multi-minima functions, Reachability Analysis and Deterministic Global Optimization of DAE Models, An exact penalty method for weak linear bilevel programming problem, Global Optimization of Mixed-Integer ODE Constrained Network Problems Using the Example of Stationary Gas Transport, Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints, Investment strategies and compensation of a mean-variance optimizing fund manager, A novel global optimization technique for high dimensional functions, A global optimization approach for generating efficient points for multiobjective concave fractional programs, Reformulations in Mathematical Programming: Definitions and Systematics, Mixed Integer Linear Programming Formulation Techniques, On a Solving Bilevel D.C.-Convex Optimization Problems, On computing ELECTRE's credibility indices under partial information, Hybrid Behavioral-Based Multiobjective Space Trajectory Optimization, Solving mixed-integer nonlinear programmes using adaptively refined mixed-integer linear programmes, Fractional programming approach to a cost minimization problem in electricity market, Automated Preference Elicitation for Decision Making, Bayesian stopping rule in discrete parameter space with multiple local maxima, Discrete tomography by convex--concave regularization and D.C. programming, On generalized bisection of 𝑛-simplices, Nonlinear convex and concave relaxations for the solutions of parametric ODEs, Minorant methods of stochastic global optimization, Global Search for Bilevel Optimization with Quadratic Data, Model Development and Optimization for Space Engineering: Concepts, Tools, Applications, and Perspectives, Global Optimization Approaches to Sensor Placement: Model Versions and Illustrative Results, On Deterministic Diagonal Methods for Solving Global Optimization Problems with Lipschitz Gradients
