[Ipopt-tickets] Re: [Ipopt] #18: number of nonzeros in inequality Jacobian constraints

[Ipopt]

#18: number of nonzeros in inequality Jacobian constraints
---------------------+------------------------------------------------------
  Reporter:  andanh  |       Owner:  ipopt-team
      Type:  defect  |      Status:  new       
  Priority:  normal  |   Component:  Ipopt     
   Version:          |    Severity:  normal    
Resolution:          |    Keywords:            
---------------------+------------------------------------------------------
Comment (by andanh):

 Hi,

 Here is IPOPT.OUT.

 Danh.

 Start reading options from stream.
 Adding option "tol" with value "1.e-4" to OptionsList.
 Adding option "mu_strategy" with value "adaptive" to OptionsList.
 Adding option "linear_solver" with value "pardiso" to OptionsList.
 Adding option "max_iter" with value "5000" to OptionsList.
 Finished reading options from file.
 Pardiso matching strategy (IPARM(13)): 1
 Pardiso matching strategy (IPARM(13)): 1
 Pardiso matching strategy (IPARM(13)): 1

 List of options:

                                     Name   Value                # times
 used
                            linear_solver = pardiso                   1
                                 max_iter = 5000                      1
                              mu_strategy = adaptive                  2
                                      tol = 0.0001                    1

 ******************************************************************************
 This program contains Ipopt, a library for large-scale nonlinear
 optimization.
  Ipopt is released as open source code under the Common Public License
 (CPL).
          For more information visit http://projects.coin-or.org/Ipopt
 ******************************************************************************

 Number of nonzeros in equality constraint Jacobian...:  1107728
 Number of nonzeros in inequality constraint Jacobian.:   767633
 Number of nonzeros in Lagrangian Hessian.............:   486001

 Scaling parameter for objective function = 1.000000e+00
 Equality constraints are not scaled.
 Inequality constraints are scaled with smallest scaling parameter is 2.
 839719e-01
 Initial values of x sufficiently inside the bounds.
 Moved initial values of s sufficiently inside the bounds.
 Calling Pardiso for symbolic factorization.

-- 
Ticket URL: <https://projects.coin-or.org/Ipopt/ticket/18>
Ipopt <http://www.coin-or.org>
Ipopt Tickets