| 
    QPALM  
   1.2.2
   Proximal Augmented Lagrangian method for Quadratic Programs 
   | 
 
Routines to perform exact linesearch.
Once the direction is found using the semismooth Newton method, the functions in this file can be called to calculate a stepsize with exact linesearch.
Definition in file linesearch.h.
 Include dependency graph for linesearch.h:
 This graph shows which files directly or indirectly include this file:Go to the source code of this file.
Functions | |
| c_float | exact_linesearch (QPALMWorkspace *work, solver_common *c) | 
| Execute exact linesearch (using qsort)   | |
| void | vec_array_copy (c_float *a, array_element *b, size_t n) | 
| Helper function to copy vector a in array b (with indices)   | |
| void | select_subsequence (const array_element *a, array_element *b, const c_int *L, size_t n) | 
| Select subsequence based on a set of indices, \(b = a(L)\).   | |
| c_float | vec_prod_ind (const c_float *a, const c_float *b, const c_int *L, size_t n) | 
| Inner product over index set, \(a(L)^T\cdot b(L)\).   | |
| int | compare (const void *a, const void *b) | 
| Helper function for qsort.   | |
| c_float exact_linesearch | ( | QPALMWorkspace * | work, | 
| solver_common * | c | ||
| ) | 
Execute exact linesearch (using qsort)
| work | Workspace | 
| c | Linear systems solver environment | 
Definition at line 14 of file linesearch.c.
 Here is the call graph for this function:
 Here is the caller graph for this function:| void vec_array_copy | ( | c_float * | a, | 
| array_element * | b, | ||
| size_t | n | ||
| ) | 
Helper function to copy vector a in array b (with indices)
| a | Vector | 
| b | Array (vector with added indices) | 
| n | Vector length | 
Definition at line 122 of file linesearch.c.
 Here is the caller graph for this function:| void select_subsequence | ( | const array_element * | a, | 
| array_element * | b, | ||
| const c_int * | L, | ||
| size_t | n | ||
| ) | 
Select subsequence based on a set of indices, \(b = a(L)\).
| a | Input array | 
| b | Outpur array | 
| L | Index set | 
| n | Length of a | 
Definition at line 134 of file linesearch.c.
 Here is the caller graph for this function:Inner product over index set, \(a(L)^T\cdot b(L)\).
| a | Vector | 
| b | Vector | 
| L | Index set | 
| n | Vector length | 
Definition at line 145 of file linesearch.c.
 Here is the caller graph for this function:| int compare | ( | const void * | a, | 
| const void * | b | ||
| ) | 
Helper function for qsort.
Carries out comparison between two array_elements
| a | Pointer to array element | 
| b | Pointer to array element | 
Definition at line 158 of file linesearch.c.
 Here is the caller graph for this function: