shark::BoxConstrainedShrinkingProblem< Problem > Class Template Reference
#include <shark/Algorithms/QP/BoxConstrainedProblems.h>
Inheritance diagram for shark::BoxConstrainedShrinkingProblem< Problem >:
Public Member Functions | |
| BoxConstrainedShrinkingProblem (Problem &problem, bool shrink=true) | |
| Public Member Functions inherited from shark::BoxBasedShrinkingStrategy< BoxConstrainedProblem< Problem > > | |
| BoxBasedShrinkingStrategy (ProblemT &problem, bool shrink=true) | |
| virtual void | updateSMO (std::size_t i, std::size_t j) |
| bool | shrink (double epsilon) |
| void | unshrink () |
| Unshrink the problem. More... | |
| void | setShrinking (bool shrinking) |
| void | setInitialSolution (RealVector const &alpha, RealVector const &gradient, RealVector const &gradientEdge) |
| Define the initial solution for the iterative solver. More... | |
| void | setInitialSolution (RealVector const &alpha) |
| Define the initial solution for the iterative solver. More... | |
| void | deactivateVariable (std::size_t i) |
| Remove the i-th example from the problem. More... | |
| void | scaleBoxConstraints (double factor, double variableScalingFactor) |
| Scales all box constraints by a constant factor and adapts the solution by scaling it by the same factor. More... | |
| virtual void | setLinear (std::size_t i, double newValue) |
| adapts the linear part of the problem and updates the internal data structures accordingly. More... | |
| void | flipCoordinates (std::size_t i, std::size_t j) |
| swap indizes (i,j) More... | |
| Public Member Functions inherited from shark::BoxConstrainedProblem< Problem > | |
| BoxConstrainedProblem (Problem &problem) | |
| std::size_t | dimensions () const |
| std::size_t | active () const |
| double | boxMin (std::size_t i) const |
| double | boxMax (std::size_t i) const |
| bool | isLowerBound (std::size_t i) const |
| bool | isUpperBound (std::size_t i) const |
| bool | isDeactivated (std::size_t i) const |
| MatrixType & | quadratic () |
| representation of the quadratic part of the objective function More... | |
| double | linear (std::size_t i) const |
| double | alpha (std::size_t i) const |
| double | diagonal (std::size_t i) const |
| double | gradient (std::size_t i) const |
| std::size_t | permutation (std::size_t i) const |
| RealVector | getUnpermutedAlpha () const |
| double | functionValue () const |
| Returns the current function value of the problem. More... | |
| bool | shrink (double) |
| void | reshrink () |
| void | unshrink () |
| void | setInitialSolution (RealVector const &alpha, RealVector const &gradient) |
| Define the initial solution for the iterative solver. More... | |
| void | setInitialSolution (RealVector const &alpha) |
| Define the initial solution for the iterative solver. More... | |
| void | deactivateVariable (std::size_t i) |
| Remove the i-th example from the problem. More... | |
| void | activateVariable (std::size_t i) |
| Reactivate an previously deactivated variable. More... | |
| void | flipCoordinates (std::size_t i, std::size_t j) |
| exchange two variables via the permutation More... | |
| double | checkKKT () const |
Detailed Description
template<class Problem>
class shark::BoxConstrainedShrinkingProblem< Problem >
Definition at line 404 of file BoxConstrainedProblems.h.
Constructor & Destructor Documentation
◆ BoxConstrainedShrinkingProblem()
template<class Problem >
|
inline |
Definition at line 406 of file BoxConstrainedProblems.h.
The documentation for this class was generated from the following file:
- include/shark/Algorithms/QP/BoxConstrainedProblems.h