Encyclopedia of Optimization

DOI10.1007/978-0-387-74759-0zbMath1156.90001OpenAlexW2526264695MaRDI QIDQ3509870

No author found.

Publication date: 25 June 2008

Full work available at URL: https://doi.org/10.1007/978-0-387-74759-0

Mathematical programming (90Cxx) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to operations research and mathematical programming (90-00) Operations research and management science (90Bxx)

Related Items

A method combining genetic algorithm with simultaneous perturbation stochastic approximation for linearly constrained stochastic optimization problems, Integrating \(\varepsilon \)-dominance and RBF surrogate optimization for solving computationally expensive many-objective optimization problems, Robust solutions to multi-facility Weber location problem under interval and ellipsoidal uncertainty, Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support, A review of recent advances in global optimization, Algorithms for the partial inverse matroid problem in which weights can only be increased, Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects, Application of a memetic algorithm for the optimal control of bunches of trajectories of nonlinear deterministic systems with incomplete feedback, Best proximity point theorems: resolution of an important non-linear programming problem, The Farkas Lemma revisited, Iterative processes for common fixed points of two different families of mappings with applications, A new variant of the memory gradient method for unconstrained optimization, A note on the two-stage hybrid flow shop problem with dedicated machines, New characterizations of weak sharp minima, Discrete optimization in partially ordered sets, Registrar: a complete-memory operator to enhance performance of genetic algorithms, Scheduling jobs with truncated exponential learning functions, The fuel optimal control problem of a hypersonic aircraft with periodic cruising mode, The column-sufficiency and row-sufficiency of the linear transformation on Hilbert spaces, A note on characterizing solution set of nonsmooth pseudoinvex optimization problem, Random search for constrained Markov decision processes with multi-policy improvement, Robust generation of constrained B-spline curves based on automatic differentiation and fairness optimization, Efficient model for interval goal programming with arbitrary penalty function, Symmetry-breaking constraints for packing identical rectangles within polyhedra, Global minimization of non-smooth unconstrained problems with filled function, Conjugate gradient type methods for the nondifferentiable convex minimization, On the Brézis Nirenberg Stampacchia-type theorems and their applications, A note on two-machine no-wait flow shop scheduling with deteriorating jobs and machine availability constraints, Variance or spectral density in sampled data filtering?, Strong convergence theorems for infinite family of relatively quasi nonexpansive mappings and systems of equilibrium problems, A deterministic global optimization using smooth diagonal auxiliary functions, On strong homogeneity of a class of global optimization algorithms working with infinite and infinitesimal scales, Best proximity point theorems: an exploration of a common solution to approximation and optimization problems, Strong convergence theorems for variational inequality problems and quasi-\(\phi\)-asymptotically nonexpansive mappings, Optimality conditions for the Henig efficient solution of vector equilibrium problems with constraints, An \(O(\sqrt nL)\) iteration primal-dual second-order corrector algorithm for linear programming, Semidefinite complementarity reformulation for robust Nash equilibrium problems with Euclidean uncertainty sets, Financing policies via stochastic control: a dynamic programming approach, Hybrid iterative scheme for fixed point problem, infinite systems of equilibrium and variational inequality problems, Recursive method of smoothing curvature of path in path planning problems for wheeled robots, An exact iterative search algorithm for constrained Markov decision processes, A multi-criteria optimization model for humanitarian aid distribution, Incremental learning optimization on knowledge discovery in dynamic business intelligent systems, Inexact alternating-direction-based contraction methods for separable linearly constrained convex optimization, Boolean trends in linear inequalities, On nonsmooth semi-infinite minimax programming problem with \((\Phi, \rho)\)-invexity, Vector optimization problem and generalized convexity, Weak efficiency in multiobjective variational problems under generalized convexity, Calmness of efficient solution maps in parametric vector optimization, Low order-value approach for solving var-constrained optimization problems, A class of linearized proximal alternating direction methods, State-constrained optimal control of nonlinear elliptic variational inequalities, Operational zones for comparing metaheuristic and deterministic one-dimensional global optimization algorithms, The validity of the ``\(\liminf\) formula and a characterization of Asplund spaces, A characterization of the subdifferential of singular Gaussian distribution functions, An inexact derivative-free Levenberg-Marquardt method for linear inequality constrained nonlinear systems under local error bound conditions, Nonsmooth semi-infinite minmax programming involving generalized \((\varPhi,\rho)\)-invexity, Conjugate gradient path method without line search technique for derivative-free unconstrained 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, On the maximum TSP with \(\gamma\)-parameterized triangle inequality, A polynomial-time approximation scheme for the two machine flow shop problem with several availability constraints, A note on generating \(P\)-matrices, Higher-order duality in vector optimization over cones, Generalized pseudolinearity, Strong convergence of a proximal point algorithm with general errors, A general method for enclosing solutions of interval linear equations, Pareto-Fenchel \({\epsilon}\)-subdifferential sum rule and \({\epsilon}\)-efficiency, Complexity of necessary efficiency in interval linear programming and multiobjective linear programming, On Lagrangian duality in vector optimization: applications to the linear case, A unified local convergence analysis of inexact constrained Levenberg-Marquardt methods, An optimum multivariate stratified double sampling design in presence of non-response, A time-based pheromone approach for the ant system, Duality for optimization problems in Banach algebras, Minimizing makespan in a two-machine flow shop with effects of deterioration and learning, Implicit and explicit algorithms for solving the split feasibility problem, Iterative approximation of zeroes of monotone operators and system of generalized mixed equilibrium problems, A policy iteration heuristic for constrained discounted controlled Markov chains, Properties and construction of NCP functions, Clonal selection: an immunological algorithm for global optimization over continuous spaces, Theoretical rate of convergence for interval inclusion functions, On the equivalence of strong formulations for capacitated multi-level lot sizing problems with setup times, The extrapolated interval global optimization algorithm, On generalized convexity of nonlinear complementarity functions, Convergence analysis for finite family of relatively quasi nonexpansive mappings and systems of equilibrium problems, A new iterative algorithm for equilibrium and fixed point problems of nonexpansive mapping, On the Dini-Hadamard subdifferential of the difference of two functions, A new hybrid iterative scheme for countable families of relatively quasi-nonexpansive mappings and system of equilibrium problems, On the efficient Gerschgorin inclusion usage in the global optimization \(\alpha\)BB method, Resolving learning rates adaptively by locating stochastic non-negative associated gradient projection points using line searches, On the search of the shape parameter in radial basis functions using univariate global optimization methods, On tightness and anchoring of McCormick and other relaxations, A generalization of the Karush-Kuhn-Tucker theorem for approximate solutions of mathematical programming problems based on quadratic approximation, On the König-Hall-Egerváry theorem for multidimensional matrices and multipartite hypergraphs, Development of metaheuristic interval minimization methods for optimal program control design, Method of parametric optimization of nonlinear continuous systems of joint estimation and control, Complex and quaternionic optimization, The method for solving variational inequality problems with numerical results, Decomposition of loosely coupled integer programs: a multiobjective perspective, (\(\epsilon\)-)efficiency in difference vector optimization, On Embeddability of Unit Disk Graphs onto Straight Lines, Multi-Objective Cuckoo Search with Leader Selection Strategies, A multi-objective approach for PH-graphs with applications to stochastic shortest paths, Instance space analysis and algorithm selection for the job shop scheduling problem, A note on maxmin problem, Metaheuristic vs. deterministic global optimization algorithms: the univariate case, Problem of groupage cargo routing in the multicommodity transport network with given tariffs and delivery time constraints, Retraction-based first-order feasible methods for difference-of-convex programs with smooth inequality and simple geometric constraints, Multiagent algorithms for optimizing bundles of trajectories of deterministic systems with incomplete instant feedback, Duality and weak efficiency in vector variational problems, A posteriori error estimates for numerical solutions to inverse problems of elastography, Optimal due-date assignment problem with learning effect and resource-dependent processing times, A note on ``Reducing the number of binary variables in cutting stock problems, Recent Theoretical Advances in Non-Convex Optimization, Solution of the three-dimensional inverse elastography problem for parametric classes of inclusions, Pareto-Fenchel ε-Subdifferential Composition Rule and ε-Efficiency, Benchmark Problems in Structural Optimization, An extension of the \(\alpha\mathrm{BB}\)-type underestimation to linear parametric Hessian matrices, Differentially Private and Budget-Limited Bandit Learning over Matroids, Super efficient solutions for set-valued maps