Go to the documentation of this file.
7 #ifndef __IPTNLPREDUCER_HPP__
8 #define __IPTNLPREDUCER_HPP__
35 const Index* index_g_skip,
37 const Index* index_xL_skip,
39 const Index* index_xU_skip,
41 const Index* index_f_fix
49 virtual bool get_nlp_info(
57 virtual bool get_bounds_info(
66 virtual bool get_scaling_parameters(
76 virtual bool get_variables_linearity(
81 virtual bool get_constraints_linearity(
86 virtual bool get_starting_point(
98 virtual bool get_warm_start_iterate(
109 virtual bool eval_grad_f(
124 virtual bool eval_jac_g(
149 virtual void finalize_solution(
163 virtual bool intermediate_callback(
171 Number regularization_size,
179 virtual Index get_number_of_nonlinear_variables();
181 virtual bool get_list_of_nonlinear_variables(
182 Index num_nonlin_vars,
183 Index* pos_nonlin_vars
Index nnz_jac_g_skipped_
Number of Jacobian nonzeros that are skipped.
Class to organize all the data required by the algorithm.
IndexStyleEnum index_style_orig_
Index style for original problem.
Index n_xU_skip_
Number of upper variable bounds to be skipped.
Index * jac_g_skipped_
Array of Jacobian elements that are to be skipped in increasing order.
Class for all IPOPT specific calculated quantities.
Index * index_g_skip_
Array of indices of the constraints that are to be skipped.
This file contains a base class for all exceptions and a set of macros to help with exceptions.
double Number
Type of all numbers.
int Index
Type of all indices of vectors, matrices etc.
Index * index_xL_skip_
Array of indices of the lower variable bounds to be skipped.
Index n_g_skip_
Number of constraints to be skipped.
Template class for Smart Pointers.
This is a wrapper around a given TNLP class that takes out a list of constraints that are given to th...
Index m_reduced_
Number of constraints in reduced NLP.
LinearityType
Linearity-types of variables and constraints.
Index * g_keep_map_
Map from original constraints to new constraints.
Base class for all NLP's that use standard triplet matrix form and dense vectors.
Index n_x_fix_
Number of variables that are to be fixed to initial value.
Index n_xL_skip_
Number of lower variable bounds to be skipped.
Index * index_xU_skip_
Array of indices of the upper variable bounds to be skipped.
SolverReturn
enum for the return from the optimize algorithm
Index * index_x_fix_
Array of indices of the variables that are to be fixed.
Index nnz_jac_g_reduced_
Number of Jacobian nonzeros in the reduced NLP.
AlgorithmMode
enum to indicate the mode in which the algorithm is
Specialized CompoundVector class specifically for the algorithm iterates.