Scribd Logo
Upload

Welcome to Scribd!

  • 50 views

    Brachistochrone ProblemIPOPTinfo

    Uploaded by

    Numkang Kang
    This document summarizes the results of running an optimization problem with the Ipopt solver. It lists the options used, problem details like variables, constraints, and nonzeros. It then shows the iteration log, concluding that an optimal solution was found in 13 iterations. Key results are an objective value of 2.5249339e+000 and overall error of 9.5636e-009, within specified tolerances.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd

    Brachistochrone ProblemIPOPTinfo

    Uploaded by

    Numkang Kang
    50 views2 pages
    This document summarizes the results of running an optimization problem with the Ipopt solver. It lists the options used, problem details like variables, constraints, and nonzeros. It then shows the iteration log, concluding that an optimal solution was found in 13 iterations. Key results are an objective value of 2.5249339e+000 and overall error of 9.5636e-009, within specified tolerances.

    Original Description:

    Brachistochrone-Problem

    Original Title

    Brachistochrone-ProblemIPOPTinfo

    Copyright

    © © All Rights Reserved

    Available Formats

    TXT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document summarizes the results of running an optimization problem with the Ipopt solver. It lists the options used, problem details like variables, constraints, and nonzeros. It then shows the iteration log, concluding that an optimal solution was found in 13 iterations. Key results are an objective value of 2.5249339e+000 and overall error of 9.5636e-009, within specified tolerances.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Download as txt, pdf, or txt
    50 views2 pages

    Brachistochrone ProblemIPOPTinfo

    Uploaded by

    Numkang Kang
    This document summarizes the results of running an optimization problem with the Ipopt solver. It lists the options used, problem details like variables, constraints, and nonzeros. It then shows the iteration log, concluding that an optimal solution was found in 13 iterations. Key results are an objective value of 2.5249339e+000 and overall error of 9.5636e-009, within specified tolerances.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Download as txt, pdf, or txt
    of 2

    List of user-set options:

    Name Value used


    linear_solver = mumps yes
    ma57_automatic_scaling = yes no
    max_iter = 2000 yes
    mu_strategy = adaptive yes
    output_file = Brachistochrone-ProblemIPOPTinfo.txt
    yes
    print_level = 5 yes
    print_user_options = yes yes
    tol = 1e-007 yes
    This is Ipopt version 3.11.0, running with linear solver mumps.

    Number of nonzeros in equality constraint Jacobian...: 1464


    Number of nonzeros in inequality constraint Jacobian.: 1
    Number of nonzeros in Lagrangian Hessian.............: 278

    Total number of variables............................: 223


    variables with only lower bounds: 0
    variables with lower and upper bounds: 223
    variables with only upper bounds: 0
    Total number of equality constraints.................: 168
    Total number of inequality constraints...............: 1
    inequality constraints with only lower bounds: 0
    inequality constraints with lower and upper bounds: 1
    inequality constraints with only upper bounds: 0

    iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls


    0 2.5249354e+000 2.52e-001 8.92e-003 0.0 0.00e+000 - 0.00e+000 0.00e+000
    0
    1 2.5254559e+000 2.52e-003 2.21e-002 -4.8 1.76e-002 - 9.68e-001 9.90e-001h
    1
    2 2.5253979e+000 2.47e-005 9.77e-003 -6.3 1.88e-002 - 9.79e-001 9.90e-001h
    1
    3 2.5249952e+000 1.01e-005 4.49e-002 -8.0 1.32e-002 - 9.43e-001 1.00e+000h
    1
    4 2.5249719e+000 5.13e-004 2.42e+000 -5.3 1.56e-001 - 9.77e-001 1.00e+000h
    1
    5 2.5249371e+000 1.35e-004 1.09e-002 -6.1 8.05e-002 - 1.00e+000 1.00e+000h
    1
    6 2.5249329e+000 3.65e-005 2.79e-003 -7.7 4.17e-002 - 1.00e+000 1.00e+000h
    1
    7 2.5249337e+000 8.92e-006 6.98e-004 -9.4 2.06e-002 - 1.00e+000 1.00e+000h
    1
    8 2.5249339e+000 2.15e-006 1.69e-004 -11.0 1.01e-002 - 1.00e+000 1.00e+000h
    1
    9 2.5249339e+000 4.77e-007 3.76e-005 -11.0 4.76e-003 - 1.00e+000 1.00e+000h
    1
    iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
    10 2.5249339e+000 9.54e-008 7.52e-006 -10.5 2.13e-003 - 1.00e+000 1.00e+000h
    1
    11 2.5249339e+000 1.94e-008 1.53e-006 -11.0 9.60e-004 - 1.00e+000 1.00e+000h
    1
    12 2.5249339e+000 2.83e-009 2.24e-007 -11.0 3.67e-004 - 1.00e+000 1.00e+000h
    1
    13 2.5249339e+000 1.21e-010 9.56e-009 -11.0 7.59e-005 - 1.00e+000 1.00e+000h
    1
    Number of Iterations....: 13

    (scaled) (unscaled)
    Objective...............: 2.5249339357004712e+000 2.5249339357004712e+000
    Dual infeasibility......: 9.5636333087687293e-009 9.5636333087687293e-009
    Constraint violation....: 1.2127346349366519e-010 1.2127346349366519e-010
    Complementarity.........: 5.6531212530178227e-011 5.6531212530178227e-011
    Overall NLP error.......: 9.5636333087687293e-009 9.5636333087687293e-009

    Number of objective function evaluations = 14


    Number of objective gradient evaluations = 14
    Number of equality constraint evaluations = 14
    Number of inequality constraint evaluations = 14
    Number of equality constraint Jacobian evaluations = 14
    Number of inequality constraint Jacobian evaluations = 14
    Number of Lagrangian Hessian evaluations = 13
    Total CPU secs in IPOPT (w/o function evaluations) = 0.016
    Total CPU secs in NLP function evaluations = 0.031

    EXIT: Optimal Solution Found.

    You might also like