scientific article

From MaRDI portal
Publication:2724100

zbMath1027.90001MaRDI QIDQ2724100

No author found.

Publication date: 9 July 2001


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items

D-optimal matrices via quadratic integer optimization, Bounds in multi-horizon stochastic programs, Minimum cost multicommodity network flow problem in time-varying networks: by decomposition principle, Fast approximate \(L_\infty\) minimization: speeding up robust regression, Global Optimization of Mixed-Integer Signomial Programming Problems, A review of recent advances in global optimization, An efficient string sorting algorithm for weighing matrices of small weight, A family of hybrid conjugate gradient methods for unconstrained optimization, Using Nemirovski's Mirror-Prox method as basic procedure in Chubanov's method for solving homogeneous feasibility problems, A computational study for bilevel quadratic programs using semidefinite relaxations, Generating functions and duality for integer programs, Adaptive nested optimization scheme for multidimensional global search, Maximizing for the sum of ratios of two convex functions over a convex set, On \texttt{MATLAB} experience in accelerating \texttt{DIRECT-GLce} algorithm for constrained global optimization through dynamic data structures and parallelization, A proximal ADMM with the Broyden family for convex optimization problems, The multidimensional truncated moment problem: the moment cone, Convergence conditions and numerical comparison of global optimization methods based on dimensionality reduction schemes, Level-set topology optimization for ductile and brittle fracture resistance using the phase-field method, Bilevel Quadratic Fractional/Quadratic Problem, The profit maximization problem in economies of scale, A global optimization point of view to handle non-standard object packing problems, Lipschitz-inspired \texttt{HALRECT} algorithm for derivative-free global optimization, An empirical study of various candidate selection and partitioning techniques in the \texttt{DIRECT} framework, Switching stepsize strategies for sequential quadratic programming, Convex underestimators of polynomials, Infinite-horizon multiobjective optimal control problems for bounded processes, Unnamed Item, On minimum weight pseudo-triangulations, The origins of quasi-concavity: a development between mathematics and economics., The generic Gröbner walk, Farkas' lemma in random locally convex modules and Minkowski-Weyl type results in \(L^0(\mathcal F,R^n)\), Canonical Duality Theory: Connections between Nonconvex Mechanics and Global Optimization, Two Symmetrized Coordinate Descent Methods Can Be $O(n^2)$ Times Slower Than the Randomized Version, Incremental method for multiple line detection problem -- iterative reweighted approach, Solving a dynamic separation problem using MINLP techniques, A characterization of concordance relations, Application of deterministic low-discrepancy sequences in global optimization, The sagitta method for solving linear programs, An Optimal Scanning Sensor Activation Policy for Parameter Estimation of Distributed Systems, Characterizing robust set containments and solutions of uncertain linear programs without qualifications, On a recurrence algorithm for continuous-time linear fractional programming problems, Fractional programming with convex quadratic forms and functions, A sequential cutting plane algorithm for solving convex NLP problems, Unconstrained Parametric Minimization of a Polynomial: Approximate and Exact, A combination of \texttt{RANSAC} and \texttt{DBSCAN} methods for solving the multiple geometrical object detection problem, Underestimation functions for a rank-two partitioning method, All stability multipliers for repeated MIMO nonlinearities, Solving convex MINLP optimization problems using a sequential cutting plane algorithm, Comparison of different multivariable control design methods applied on half car test setup, Positive semidefinite matrix completions on chordal graphs and constraint nondegeneracy in semidefinite programming, Optimal solutions to a class of nonconvex minimization problems with linear inequality constraints, A new \texttt{DIRECT-GLh} algorithm for global optimization with hidden constraints, Knapsack constraint reformulation: A new approach that significantly reduces the number of sub-problems in the branch and bound algorithm, A method for improving the accuracy of data mining classification algorithms, Convex integer maximization via Graver bases, Optimum allocation in stratified surveys: stochastic programming, Multi-objective evacuation routing in transportation networks, La valeur optimale des programmes entiers. (The optimal value of integer programs), An Algorithm for Construction of Constrained D-Optimum Designs, Solving the drift control problem, Application of Fuzzy Programming Method for Solving Nonlinear Fractional Programming Problems with Fuzzy Parameters, A Hybrid Metaheuristic for Routing on Multicast Networks, Farkas lemma for convex systems revisited and applications to sublinear-convex optimization problems, Review and comparison of algorithms and software for mixed-integer derivative-free optimization, Inextensible surface reconstruction under small relative deformations from distributed angle measurements