Stack Overflow
Stack Overflow

Questions tagged [convex]

Anything related to convex geometric shapes. A shape in an Euclidean space is convex if, given two points A and B, every point of the segment AB belongs to the shape, i.e. AB is a subset of the shape.

Anything related to convex geometric shapes.

A shape in an Euclidean space is convex if, given two points A and B, every point of the segment AB belongs to the shape, i.e. AB is a subset of the shape.

See Wikipedia on:

139 questions
1
vote
0 answers

Finding points outside a convex polygon which are normal to its edges

I am working with 2D convex polygons, and have two sets of points surrounding it, lets call the neighborhood closest to the polygon A and the one further out B. These sets of points are offsets of the original polygon, the offsetting itself was done…
APM500
  • 85
  • 1
  • 7
1
vote
1 answer

Evaluate the weights of a convex combination

I'm using the scipy.spatial.ConvexHull API for evaluating the convex hull of a set of points and it works well. Given the code below: p1 = points[11] hull = ConvexHull(points) vertices = [points[i] for i in hull.vertices] how can I evaluate the…
Moshe
  • 555
  • 3
  • 14
1
vote
1 answer

Optimization based line fitting

I am using the following optimization script by which I am fitting the following curve y(t)=c_1+c_2 e^{-t} between two points y_1(t_1=0)=1 and y_2(t_2=10)=7 My question is, how can I solve the same optimization problem by adding the constraints…
Iko-SOF
  • 77
  • 1
  • 7
1
vote
0 answers

Convex optimization with bounds for the parameters in Python

For a project that I am currently working on, I need to optimize a convex problem. As can be read only there are different optimization tools in python in order to obtain the solution of a convex problem (e.g. scipy, CVXPY). However, by implementing…
Dirk
  • 11
  • 1
1
vote
1 answer

How to solve an objective function having an exponential term with a different base in CVXR?

I am using CVXR to solve a concave objective function. The decision variable (x) is one-dimensional and the objective function is the summation of 2 logarithmic terms in which the second term is exponential with different bases of “a and b” (e.g.,…
Homa Rashidisabet
  • 11
  • 3
1
vote
1 answer

Python non convex optimization

I use the package cvxpy form Python to solve a non convex optimization problem which is given as follows: import numpy as np import cvxpy as cp def kl(a,b): if a==b: return 0.000001 if b==0: return 1000000 if a==0: …
Maurice Rolvien
  • 11
  • 2
1
vote
1 answer

I there a R function for finding a minimum between to pairs?

I need to identify pairs of variables that are dominated: if both values of the pair are lower than the other pairs in the data. I already tried the functions min or pmin but I am not sure if they are the most appropriate. a = matrix(c(50,70),…
Simon
  • 349
  • 2
  • 12
1
vote
0 answers

How to merge extreme points of observations and select dominating units only?

I need to build an algorithm which will: For 116 existing observations of 2 variables x1 and x2 (plotted individually: one single point) Create new observations by merging extreme points of 2 existing observations (ex: observation 117 will have 2…
Simon
  • 349
  • 2
  • 12
1
vote
0 answers

What is this Convex Hull Algorithm for 2D convex Planes called?

I found a convex hull algorithm that orders a set of given points of a 3D convex plane after a projection to 2D. What is this algorithm called? I looked up common algorithms: jarvis march, quickhull, chan's, graham scan and none of them matches. The…
user11340747
1
vote
0 answers

Strongly convex problem has UNBOUNDED status using CVX

I am trying to minimize a function of the following type: f(x)=LogSumExp(Ax)+b'*x+||x||^2 Using CVX in MATLAB, CVX outputs "Status: Unbounded Optimal value (cvx_optval): -Inf" This is not reasonable given the fact it is a strongly convex function.…
Bertrand Travacca
  • 11
  • 4
1
vote
1 answer

CPLEX OPL Error 5002: Constraint not convex

I'm trying to work with cplex opl and facing an error. I read the manual and googled but I still have no idea what I should do to fix this error due to my lacking of knowledge. Can anyone please help or give me ideas to figure this out? I really…
tabacoben
  • 41
  • 2
1
vote
0 answers

MATLAB `convnhulln` doesn't support Qhull normals option?

Suppose I have a set of vertices, e.g. V = [ 0 0 ; 1 0 ; 0 1] and I want to construct their convex hull in MATLAB. Using the convhulln command, I can extract the vertex indices for the facets of the hull e.g. convhulln(V) yields ans = 1 2 …
Semiclassical
  • 111
  • 2
1
vote
1 answer

Python optimization algorithm to maximize the ellipse inside arbitrary polygon

I'm trying to make biggest ellipse inside arbitrary polygon. So, I made the equation of ellipse and constraint . objective : minimize A*B (mimimaze 1/area) st. A**2*(x-x0)**2+B**2*(y-y0)**2 = 0 x/100.0 + y/80.0 < 1 x/-20.0 +…
MJ.Shin
  • 381
  • 1
  • 9
1
vote
0 answers

Max area quadrilateral inside a convex

I'm having trouble finding an efficient algorithm for the next problem: Given a convex polygon of size N (when N > 4), find a quadrilateral which is inclosed in the polygon with a maximal area You can solve it in O(N^4) by choosing 4 points on the…
Ofer Magen
  • 942
  • 1
  • 9
  • 19
1
vote
2 answers

Convexity of ratio of two linear functions

I am working on optimization of an objective function which is a ratio of two linear functions given as mx + b/-mx+c. Can somebody comment about convexity of this function and/or give me some reference?
sukhalid
  • 43
  • 9
1 2 3
…
9 10