Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
scientific article - MaRDI portal

scientific article

From MaRDI portal
Publication:3738922

zbMath0602.90090MaRDI QIDQ3738922

Michel Minoux

Publication date: 1986


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



Related Items

A Globally Convergent Numerical Method for a 3D Coefficient Inverse Problem for a Wave-Like Equation, Linear programming with entropic perturbation, A relaxed cutting plane algorithm for solving fuzzy inequality systems, Carleman contraction mapping for a 1D inverse scattering problem with experimental time-dependent data, A Proof of Convergence of the Concave-Convex Procedure Using Zangwill's Theory, Ollivier--Ricci Idleness Functions of Graphs, Principal component analysis-based control charts using support vector machines for multivariate non-normal distributions, A robust optimization model for dynamic market with uncertain production cost, An integer programming formulation of the Steiner problem in graphs, An efficient approach to optimization of semi‐stable routing in multicommodity flow networks, Hyperbolic regression: a new regression model with applications to the binary classification problem, An unconstrained dual approach to solving Karmarkar-type linear programs using conventional barrier functions, Parallel approximation to high multiplicity scheduling problemsVIAsmooth multi-valued quadratic programming, A Discrete-Time Neurodynamic Approach to Sparsity-Constrained Nonnegative Matrix Factorization, Accelerating Benders method using covering cut bundle generation, Sequential stable Kuhn-Tucker theorem in nonlinear programming, On the solution of the generalized steiner problem by the subgradient method, A Revisited Half-Quadratic Approach for Simultaneous Robust Fitting of Multiple Curves, Induction heating processes optimization: A general optimal control approach, A subgradient-based optimization for reservois system management, A deterministic annealing algorithm for approximating a solution of the min-bisection problem, Traffic allocation for manufacturing systems, Implementation of augmented Lagrangian methods for equilibrium problems, Minimizing variation of production rates in just-in-time systems: A survey, A constraint generation scheme to probabilistic linear problems with an application to power system expansion planning, A bicriterion objective for levelling the schedule of a mixed-model, \(JIT\) assembly process, A quadratically convergent global algorithm for the linearly-constrained minimum cross-entropy problem, Classification of temporal trajectories by continuous-time recurrent nets, Computational efficiency of the simplex embedding method in convex nondifferentiable optimization, Solving nonlinear multicommodity flow problems by the analytic center cutting plane method, Traffic engineering of tunnel-based networks with class specific diversity requirements, The dynamic programming method in the generalized traveling salesman problem, Second-order minimization method for nonsmooth functions allowing convex quadratic approximations of the augment, Optical tomography reconstruction algorithm with the finite element method: an optimal approach with regularization tools, Bilevel programming in traffic planning: Models, methods and challenge, A generalized subgradient method with relaxation step, Computing complex chemical equilibria by generalized linear programming, A hybrid approach of bundle and Benders applied large mixed linear integer problem, A new algorithm for minimizing convex functions over convex sets, A simple solution to the \(\ell ^ 1\) optimization problem, An efficient computational procedure for solving entropy optimization problems with infinitely many linear constraints, A branch-and-reduce approach to global optimization, Subgradient method with entropic projections for convex nondifferentiable minimization, Solution of a tinned iron purchasing problem by Lagrangean relaxation, A framework for randomized time-splitting in linear-quadratic optimal control, Job distribution algorithms, An approximation algorithm for graph partitioning via deterministic annealing neural network, Triangular NURBS and their dynamic generalizations, A majorization-minimization approach to the sparse generalized eigenvalue problem, Gradient-type methods: a unified perspective in computer science and numerical analysis, A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments, An SQP-type method and its application in stochastic programs, An \(O(n)\) algorithm for projecting a vector on the intersection of a hyperplane and a box in \(\mathbb R^n\), Convexification-based globally convergent numerical method for a 1D coefficient inverse problem with experimental data, Stochastic dual dynamic programming applied to nonconvex hydrothermal models, A deterministic annealing algorithm for the minimum concave cost network flow problem, Speed-up Benders decomposition using maximum density cut (MDC) generation, A constrained-optimization based half-quadratic algorithm for robustly Fitting sets of linearly parametrized curves, On the use of reduced models obtained through identification for feedback optimal control problems in a heat convection-diffusion problem, First-order dominance: stronger characterization and a bivariate checking algorithm, Image classification using PSO-SVM and an RGB-D sensor, Solving fuzzy inequalities with concave membership functions, Adaptivity with relaxation for ill-posed problems and global convergence for a coefficient inverse problem, Numerical adaptation of pipeline network models on measurement archive, Almost definiteness of matrices on polyhedral cones, Stable sequential Kuhn-Tucker theorem in iterative form or a regularized Uzawa algorithm in a regular nonlinear programming problem, Path generation for affine flow thinning, Lagrangean duality for facial programs with applications to integer and complementarity problems, On the problem of operation speed for the class of linear infinite-dimensional discrete-time systems with bounded control, The Benders decomposition algorithm: a literature review, Exponential stability based design of constrained fuzzy predictive control, An algorithm for linearly constrained programs with a partly linear objective function, Complexity and algorithms for nonlinear optimization problems, Quasisolution of an inverse boundary-value problem in aerohydrodynamics with a limited maximum velocity on a contour in a range of angles of attack, Numerical recovery of gas flows in pipeline systems, Saddle points of general augmented Lagrangians for constrained nonconvex optimization, Sustainable management of remanufacturing in dynamic supply chains, LMI based design of constrained fuzzy predictive control, Nonsmooth nonconvex global optimization in a Banach space with a basis, A model for analyzing multi-channel distribution systems, Resolution method for mixed integer bi-level linear problems based on decomposition technique, A discrete-continuous routing problem with precedence constraints, A generalization of the Karush-Kuhn-Tucker theorem for approximate solutions of mathematical programming problems based on quadratic approximation, A new formulation and an exact approach for the many-to-many hub location-routing problem, Sparse randomized shortest paths routing with Tsallis divergence regularization, A branch and reduce approach for solving a class of low rank d.c. programs, A class of problems for which cyclic relaxation converges linearly, On one approach to realization of the branch-and-bound method on a distributed system, Gradient projection and local region search for multiobjective optimisation, Properties of saddle points for generalized augmented Lagrangian, Conditional subgradient optimization -- theory and applications, A lower bound for the shortest Hamiltonean path in directed graphs, Long-scale ollivier Ricci curvature of graphs, Nonparametric estimation of nonlinear rational expectation models, Project selection with discounted returns and multiple constraints, Duallity and sensitivity in nonconvex quadratic optimization over an ellipsoid, Mean value cross decomposition applied to integer programming problems, A linear-time median-finding algorithm for projecting a vector on the simplex of \({\mathbb{R}}^ n\), Dual regularization in non-linear inverse scattering problems, Performance optimization of a class of discrete event dynamic systems using calculus of variations techniques, On the projected subgradient method for nonsmooth convex optimization in a Hilbert space, Non-cooperative competition among revenue maximizing service providers with demand learning, Optimization of capacity expansion planning for gas transportation networks, Semi-obnoxious location models: A global optimization approach, Lagrangian duality of concave minimization subject to linear constraints and an additional facial reverse convex constraint, The constrained Newton method on a Lie group and the symmetric eigenvalue problem, Relations among prices at adjacent nodes in an electric transmission network, Solving a system of infinitely many fuzzy inequalities with piecewise linear membership functions, Necessary and sufficient conditions for emptiness of the cones of generalized support vectors, Application of the scenario aggregation approach to a two-stage, stochastic, common component, inventory problem with a budget constraint, Cellular control of manufacturing systems, Cocontraction of pairs of antagonistic muscles: Analytical solution for planar static nonlinear optimization approaches, Minimising conservatism in infinite-horizon LQR control, A multiscale computational approach for contact problems, Sub-sample swapping for sequential Monte Carlo approximation of high-dimensional densities in the context of complex object tracking, On the convergence of the conditional gradient method as applied to the optimization of an elliptic equation, A branch and bound to minimize the number of late jobs on a single machine with release time constraints, B\&B frameworks for the capacity expansion of high speed telecommunication networks under uncertainty