Lines Matching refs:Problem
46 class Problem;
59 // Default constructor that sets up a generic sparse problem.
148 // is contracted and the model optimization problem is solved
177 // maximum rank. The best choice usually requires some problem
196 // performance for certain classes of problem, which is why it is disabled
198 // sensitivity of the problem to different parameters varies significantly,
222 // Solving the line search problem exactly is computationally
508 // e.g., consider the following regression problem
519 // eliminate the variables a_1 and a_2 from the problem all
521 // squares problem and the most famous algorithm for solving them
526 // missing data problem. There the corresponding algorithm is
538 // computed for the whole problem (a_1, a_2, b_1, b_2, c_1) and
544 // for the full problem, and then use it as the starting point to
622 // region problem. Useful for testing and benchmarking. If empty
721 // Cost of the problem before and after the optimization. See
722 // problem.h for definition of the cost of a problem.
811 // Once a least squares problem has been built, this function takes
812 // the problem and optimizes it based on the values of the options
817 Problem* problem,
823 Problem* problem,
