A tolerant algorithm for linearly constrained optimization calculations
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3793774 (Why is no real title available?)
- scientific article; zbMATH DE number 3407464 (Why is no real title available?)
- A numerically stable dual method for solving strictly convex quadratic programs
- Automorphisms of induced extensions
- Convergence Conditions for Ascent Methods
- Test examples for nonlinear programming codes
- Updating conjugate directions by the BFGS formula
Cited in
(29)- Minimal energy surfaces using parametric splines
- Active set algorithm for mathematical programs with linear complementarity constraints
- Genetically controlled random search: a global optimization method for continuous multidimensional functions
- Modifications of real code genetic algorithm for global optimization
- GLOBAL CONVERGENCE OF A GENERAL SAMPLING ALGORITHM FOR DYNAMIC NONLINEAR STOCHASTIC PROGRAMS
- Epigraphical nesting: A unifying theory for the convergence of algorithms
- Constrained optimization: A general tolerance approach
- Stochastic analysis of a non-homogeneous Markov system
- Use of the Reduced Tolerance Approach to Rank Efficient Solutions
- Manufacturer's return policy in a two-stage supply chain with two risk-averse retailers and random demand
- A stochastic optimization algorithm for analyzing planar central and balanced configurations in the \(n\)-body problem
- Orthogonal and conjugate basis methods for solving equality constrained minimization problems
- Enhancing PSO methods for global optimization
- Local convergence analysis for the REQP algorithm using conjugate basis matrices
- Partial spectral projected gradient method with active-set strategy for linearly constrained optimization
- Optimization over convex polyhedra via Hadamard parametrizations
- Modelling and estimation of social interaction effects in new product diffusion
- Test signal planning for identifying the aerodynamic characteristics of automatically controlled aircraft taking into account the uncertainty of a priori data
- A parallel quadratic programming method for dynamic optimization problems
- Genanneal: genetically modified simulated annealing
- MinFinder: locating all the local minima of a function
- Solving continuous min-max problems by an iterative entropic regularization method.
- Stopping rules for box-constrained stochastic global optimization
- MERLIN-3. 0. A multidimensional optimization environment
- On locating all roots of systems of nonlinear equations inside bounded domain using global optimization methods
- A least squares approach for efficient and reliable short-term versus long-term optimization
- PDoublePop: an implementation of parallel genetic algorithm for function optimization
- The Method of Pairwise Variations with Tolerances for Linearly Constrained Optimization Problems
- Derivative-free optimization with transformed objective functions and the algorithm based on the least Frobenius norm updating quadratic model
This page was built for publication: A tolerant algorithm for linearly constrained optimization calculations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q910337)
