Skip to main content
Search type Search syntax
Tags [tag]
Exact "words here"
Author user:1234
user:me (yours)
Score score:3 (3+)
score:0 (none)
Answers answers:3 (3+)
answers:0 (none)
isaccepted:yes
hasaccepted:no
inquestion:1234
Views views:250
Code code:"if (foo != bar)"
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Saves in:saves
Status closed:yes
duplicate:no
migrated:no
wiki:no
Types is:question
is:answer
Exclude -[tag]
-apples
For more details on advanced search visit our help page
Results tagged with
Search options not deleted user 9022

Nonlinear objectives, nonlinear constraints, non-convex objective, non-convex feasible region.

4 votes

Nonconvex optimization problem

In general, you can show that a class of problems is NP-Hard by taking a known NP-hard problem and reducing it to a problem in your class (being careful that size of the problem does not increase too …
Brian Borchers's user avatar
1 vote
Accepted

minimization of a function when the feasible set is an unbounded cone

No. The problem with this simple minded approach is that the sequence of constraints that you add might go on forever without adding a critical constraint. Consider the following example problem. …
Brian Borchers's user avatar
2 votes
Accepted

A non-convex quadratically constrained quadratic program

It's helpful if you cite the paper in which you saw something that you're asking a question about- we could provide a better answer if we knew where the question came from. First, assume without lo …
Brian Borchers's user avatar