scientific article; zbMATH DE number 4046981
[For the entire collection see Zbl 0637.00009.] Active-set feasible point methods are widely used for solving the linearly constrained optimization problem: minimize f(x) subject to C Tx\(\geq b\), where f(x) is a sufficiently smooth and, in general, nonlinear function of the n-vector x, C T is an \(m\times n\) matrix, b is an m- vector. We give strategies for simultaneously dropping more than one constraint from the active set A which ensure that the step taken after the constraints are dropped does not violate any of the constraints in A. We also consider the criterion for choosing a particular constraint to drop when there are several possibilities from which to choose.
- Incremental constraint deletion in systems of linear constraints
- scientific article; zbMATH DE number 5670814
- Optimization over the efficient set using an active constraint approach
- Improving delete relaxation heuristics through explicitly represented conjunctions
- A constraint programming approach to cutset problems
- Active set algorithm for mathematical programs with linear complementarity constraints
- On algorithms for decomposable constraints
- scientific article; zbMATH DE number 1213132
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3783442)