Encyclopedia of Optimization
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Pareto-Fenchel \({\epsilon}\)-subdifferential composition rule and \({\epsilon}\)-efficiency
- A posteriori error estimates for numerical solutions to inverse problems of elastography
- Problem of groupage cargo routing in the multicommodity transport network with given tariffs and delivery time constraints
- Nonsmooth semi-infinite minmax programming involving generalized \((\varPhi,\rho)\)-invexity
- Conjugate gradient path method without line search technique for derivative-free unconstrained optimization
- Recursive method of smoothing curvature of path in path planning problems for wheeled robots
- Robust generation of constrained B-spline curves based on automatic differentiation and fairness optimization
- Retraction-based first-order feasible methods for difference-of-convex programs with smooth inequality and simple geometric constraints
- Multi-Objective Cuckoo Search with Leader Selection Strategies
- Development of metaheuristic interval minimization methods for optimal program control design
- Recent Theoretical Advances in Non-Convex Optimization
- Method of parametric optimization of nonlinear continuous systems of joint estimation and control
- Theoretical rate of convergence for interval inclusion functions
- Integrating -dominance and RBF surrogate optimization for solving computationally expensive many-objective optimization problems
- Properties and construction of NCP functions
- Solution of the three-dimensional inverse elastography problem for parametric classes of inclusions
- An inexact derivative-free Levenberg-Marquardt method for linear inequality constrained nonlinear systems under local error bound conditions
- A note on the two-stage hybrid flow shop problem with dedicated machines
- Conjugate gradient type methods for the nondifferentiable convex minimization
- An optimum multivariate stratified double sampling design in presence of non-response
- A time-based pheromone approach for the ant system
- (-)efficiency in difference vector optimization
- A note on characterizing solution set of nonsmooth pseudoinvex optimization problem
- Implicit and explicit algorithms for solving the split feasibility problem
- Globally-biased disimpl algorithm for expensive global optimization
- On Lagrangian duality in vector optimization: applications to the linear case
- Higher-order duality in vector optimization over cones
- Decomposition of loosely coupled integer programs: a multiobjective perspective
- Scheduling jobs with truncated exponential learning functions
- On nonsmooth semi-infinite minimax programming problem with (, )-invexity
- A method combining genetic algorithm with simultaneous perturbation stochastic approximation for linearly constrained stochastic optimization problems
- Encyclopedia of optimization. In 6 vols.
- Inexact alternating-direction-based contraction methods for separable linearly constrained convex optimization
- Iterative processes for common fixed points of two different families of mappings with applications
- A note on maxmin problem
- On generalized convexity of nonlinear complementarity functions
- On the maximum TSP with -parameterized triangle inequality
- A note on generating P-matrices
- A general method for enclosing solutions of interval linear equations
- Pareto-Fenchel \({\epsilon}\)-subdifferential sum rule and \({\epsilon}\)-efficiency
- Optimality conditions for the Henig efficient solution of vector equilibrium problems with constraints
- Iterative approximation of zeroes of monotone operators and system of generalized mixed equilibrium problems
- Clonal selection: an immunological algorithm for global optimization over continuous spaces
- On Embeddability of Unit Disk Graphs onto Straight Lines
- Boolean trends in linear inequalities
- The extrapolated interval global optimization algorithm
- A new iterative algorithm for equilibrium and fixed point problems of nonexpansive mapping
- On strong homogeneity of a class of global optimization algorithms working with infinite and infinitesimal scales
- A note on ``Reducing the number of binary variables in cutting stock problems
- The Farkas Lemma revisited
- Variance or spectral density in sampled data filtering?
- Best proximity point theorems: an exploration of a common solution to approximation and optimization problems
- Efficient model for interval goal programming with arbitrary penalty function
- Robust solutions to multi-facility Weber location problem under interval and ellipsoidal uncertainty
- Global minimization of non-smooth unconstrained problems with filled function
- A new hybrid iterative scheme for countable families of relatively quasi-nonexpansive mappings and system of equilibrium problems
- On the Brézis Nirenberg Stampacchia-type theorems and their applications
- Super efficient solutions for set-valued maps
- Strong convergence theorems for infinite family of relatively quasi nonexpansive mappings and systems of equilibrium problems
- Convergence analysis for finite family of relatively quasi nonexpansive mappings and systems of equilibrium problems
- A review of recent advances in global optimization
- On the Dini-Hadamard subdifferential of the difference of two functions
- An \(O(\sqrt nL)\) iteration primal-dual second-order corrector algorithm for linear programming
- Incremental learning optimization on knowledge discovery in dynamic business intelligent systems
- Weak efficiency in multiobjective variational problems under generalized convexity
- Low order-value approach for solving var-constrained optimization problems
- Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants
- Strong convergence theorems for variational inequality problems and quasi-\(\phi\)-asymptotically nonexpansive mappings
- 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
- Optimal due-date assignment problem with learning effect and resource-dependent processing times
- On the König-Hall-Egerváry theorem for multidimensional matrices and multipartite hypergraphs
- Best proximity point theorems: resolution of an important non-linear programming problem
- On the search of the shape parameter in radial basis functions using univariate global optimization methods
- Resolving learning rates adaptively by locating stochastic non-negative associated gradient projection points using line searches
- Complexity of necessary efficiency in interval linear programming and multiobjective linear programming
- Generalized pseudolinearity
- Strong convergence of a proximal point algorithm with general errors
- An extension of the \(\alpha\mathrm{BB}\)-type underestimation to linear parametric Hessian matrices
- Differentially private and budget-limited bandit learning over matroids
- Hybrid iterative scheme for fixed point problem, infinite systems of equilibrium and variational inequality problems
- Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support
- 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
- Duality and weak efficiency in vector variational problems
- Application of a memetic algorithm for the optimal control of bunches of trajectories of nonlinear deterministic systems with incomplete feedback
- Metaheuristic vs. deterministic global optimization algorithms: the univariate case
- A unified local convergence analysis of inexact constrained Levenberg-Marquardt methods
- Benchmark problems in structural optimization
- An exact iterative search algorithm for constrained Markov decision processes
- The method for solving variational inequality problems with numerical results
- A multi-criteria optimization model for humanitarian aid distribution
- A class of linearized proximal alternating direction methods
- A policy iteration heuristic for constrained discounted controlled Markov chains
- Symmetry-breaking constraints for packing identical rectangles within polyhedra
- Operational zones for comparing metaheuristic and deterministic one-dimensional global optimization algorithms
- The column-sufficiency and row-sufficiency of the linear transformation on Hilbert spaces
- Registrar: a complete-memory operator to enhance performance of genetic algorithms
- Random search for constrained Markov decision processes with multi-policy improvement
- Multiagent algorithms for optimizing bundles of trajectories of deterministic systems with incomplete instant feedback
This page was built for publication: Encyclopedia of Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3509870)
