Why fmincon's interior-point algorithm gives infeasible points for feasibility problem?

1 次查看（过去 30 天）
Abdolkarim Mohammadi
编辑： Sean de Wolski 2019-4-29
I am creating an initial feasible population for my optimization problem along the lines of this. I tried the technique with different solvers included in fmincon and noticed that albeit slowly, the medium-scale solvers sqp and active-set could give me feasible points but some points returned by the large-scale interior-point did not satisfy the constraints. Why this happens?
My problem has about 2000 linear inequality constraints and about 1500 variables, where none of them are integers.
  1 个评论
Sean de Wolski
Sean de Wolski 2019-4-29
编辑：Sean de Wolski 2019-4-29
Post the MAT file containing the constraints and the code you use to optimize. IP should not be returning infeasible points and it is likely a bug in your constraints.

请先登录，再进行评论。

请先登录，再回答此问题。

回答（0 个）

类别

在 Help Center 和 File Exchange 中查找有关 Solver Outputs and Iterative Display 的更多信息

标签

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by