Question

IPOPT solver cannot solve MPC problem in presence of non-convex objective

score 93 · Answer 1 · 2023-06-24 13:31:40

93

Views

IPOPT solver cannot solve MPC problem in presence of non-convex objective

Published on 24 Jun 2023 - 13:31

score 18 · Answer 2 · 2023-07-06 21:41:11

18

Views

Handling non-convex feasible region (sigmoidal constraint) of a quadratic programming (Quadratic programming with sigmoidal constraint)

Published on 06 Jul 2023 - 21:41

score 43 · Answer 3 · 2023-07-16 07:57:43

43

Views

Commercial solvers for non-convex optimization problems

Published on 16 Jul 2023 - 7:57

score 44 · Answer 4 · 2023-07-18 11:19:00

44

Views

convert constrained problem to unconstrained problem

Published on 18 Jul 2023 - 11:19

score 132 · Answer 5 · 2026-03-27 02:16:20

132

Views

Box-constrained QCQP

Published on 27 Mar 2026 - 2:16

score 26 · Answer 6 · 2026-03-25 12:15:17

26

Views

is a function which all stationary points are global minima prox-regular for some $\alpha$>0?

Published on 25 Mar 2026 - 12:15

score 45 · Answer 7 · 2026-03-27 23:32:09

45

Views

Point in polytope that is farthest from the origin

Published on 27 Mar 2026 - 23:32

score 27 · Answer 8 · 2026-03-25 17:40:47

27

Views

The dual of this SDP with a simple nonconvex constraint

Published on 25 Mar 2026 - 17:40

score 43 · Answer 9 · 2023-08-23 15:20:41

43

Views

What algorithm to use to optimize an expensive multi-variable function that is known to be dominated by a term depending only on the first few inputs?

Published on 23 Aug 2023 - 15:20

score 271 · Answer 10 · 2026-03-26 19:29:11

271

Views

Can I linearize this piecewise function so it can be used in an objective function for my LP optimization model?

Published on 26 Mar 2026 - 19:29

score 70 · Answer 11 · 2023-08-29 03:55:59

70

Views

Can we bound the derivative of a max using derivatives at the max?

Published on 29 Aug 2023 - 3:55

score 134 · Answer 12 · 2026-03-25 23:42:44

134

Views

Dimension of the manifold of symmetric rank $r$ $n\times n$ matrices

Published on 25 Mar 2026 - 23:42

score 33 · Answer 13 · 2023-09-02 09:42:54

33

Views

How to transform optimization problems involving Bessel functions into convex optimization problems

Published on 02 Sep 2023 - 9:42

score 81 · Answer 14 · 2023-09-11 08:44:52

81

Views

given a binary point, design a quadratic which is minimized at that point!

Published on 11 Sep 2023 - 8:44

score 27 · Answer 15 · 2023-09-17 16:52:16

27

Views

DC programming and saddle-point problems

Published on 17 Sep 2023 - 16:52

List Question

IPOPT solver cannot solve MPC problem in presence of non-convex objective

Handling non-convex feasible region (sigmoidal constraint) of a quadratic programming (Quadratic programming with sigmoidal constraint)

Commercial solvers for non-convex optimization problems

convert constrained problem to unconstrained problem

Box-constrained QCQP

is a function which all stationary points are global minima prox-regular for some $\alpha$>0?

Point in polytope that is farthest from the origin

The dual of this SDP with a simple nonconvex constraint

What algorithm to use to optimize an expensive multi-variable function that is known to be dominated by a term depending only on the first few inputs?

Can I linearize this piecewise function so it can be used in an objective function for my LP optimization model?

Can we bound the derivative of a max using derivatives at the max?

Dimension of the manifold of symmetric rank $r$ $n\times n$ matrices

How to transform optimization problems involving Bessel functions into convex optimization problems

given a binary point, design a quadratic which is minimized at that point!

DC programming and saddle-point problems

Trending Questions

Popular # Hahtags

Popular Questions