8000 New `nlp_solver_type`: `SQP_WITH_FEASIBLE_QP` by david0oo · Pull Request #1444 · acados/acados · GitHub
[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to content

New nlp_solver_type: SQP_WITH_FEASIBLE_QP #1444

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 322 commits into from
Mar 14, 2025
Merged

New nlp_solver_type: SQP_WITH_FEASIBLE_QP #1444

merged 322 commits into from
Mar 14, 2025

Conversation

david0oo
Copy link
Contributor
@david0oo david0oo commented Feb 21, 2025

This PR introduces a novel nlp_solver_type named SQP_WITH_FEASIBLE_QP.
This algorithm overcomes the issue of infeasible QPs during the iteration process.
The solver primarily tries to perform standard SQP iterations.
In case the nominal QP cannot be solved, the following actions are performed:

  • Solve a feasibility QP
  • Use the optimal slack variables of the feasibility QP to adjust the bounds of the nominal QP. This guarantees a feasible nominal QP (with adjusted bounds)
  • Solve the nominal QP with adjusted bounds

The following options were added:

  • globalization_funnel_use_merit_fun_only: This turns off the funnel method and only checks the penalty function for step acceptance. The funnel method employs the penalty phase instead of a feasibility restoration phase. In general, the funnel allows for more nonmonotonicity which often results in faster convergence.
  • use_constraint_hessian_in_feas_qp: Decides if exact constraint Hessian or the identity matrix with small scaling (10e-4) should be used in the feasibility QP
  • search_direction_mode: Specifies which search direction mode should be used in the first iteration. Might be NOMINAL_QP or BYRD_OMOJOKUN
  • allow_direction_mode_switch_to_nominal: If set to true, the solver does not allow switches in the search direction mode. Can be used to only solve problems in the BYRD_OMOJOKUN mode.

Note that the novel method is still in a preliminary state and its development is still ongoing. The following problems can still happen:

  • HPIPM fails: This often happens if the problem is badly scaled. This can be related to the objective function scaling. For more robustness of the IP method of HPIPM set solver_options.qp_solver_mu0 = 1e4.
  • Additionally, we recommend to use solver_options.qp_solver = 'PARTIAL_CONDENSING_HPIPM' with solver_options.qp_solver_cond_N = N to perform no condensing. Condensing can worsen the conditioning which can yield problems.

If you encounter problems or bugs, please report them in the acados forum. We are happy about your testing.

This method is inspired by the following papers:

  • J. V. Burke, F. E. Curtis, and H. Wang, A Sequential Quadratic Optimization Algorithm with Fast Infeasibility Detection, SIAM J. Optim., 24 (2014), pp. 839-872.
  • J.V. Burke and S.-P. Han. A robust sequential quadratic programming method. Math.
    Program., 43(1-3):277–303, 1989.

david0oo and others added 30 commits October 8, 2024 16:23
…calculate the algorithmic l1-slacks in the NLP
…ents (acados#1293)

This allows one to solve QPs with data other than the default `qp_in`
and `qp_out`.
…culation of the qps. If feasibility direction in QP is used properly, the trajectories look good
@FreyJo FreyJo marked this pull request as ready for review March 11, 2025 16:24
@david0oo david0oo assigned david0oo and unassigned david0oo Mar 13, 2025
@david0oo david0oo requested a review from sandmaennchen March 13, 2025 09:15
@FreyJo FreyJo merged commit e27aeef into acados:main Mar 14, 2025
14 checks passed
@FreyJo FreyJo deleted the byrd_2 branch March 14, 2025 12:36
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

3 participants
0