Minimize subject to constraints :

Several linear inequality constraints can be expressed with VectorGreaterEqual:

Use v>= or \[VectorGreaterEqual] to enter the vector inequality sign :

An equivalent form using scalar inequalities:

Use a vector variable :

The inequality may not be the same as due to possible threading in :

To avoid unintended threading in , use Inactive[Plus]:

Use constant parameter equations to avoid unintended threading in :

VectorGreaterEqual represents a conic inequality with respect to the "NonNegativeCone":

To explicitly specify the dimension of the cone, use {"NonNegativeCone",n}:

Find the solution:

Minimize subject to the constraint :

Specify the constraint using a conic inequality with "NormCone":

Find the solution:

Minimize subject to the positive semidefinite matrix constraint :

Find the solution:

Use a vector variable and Indexed[x,i] to specify individual components:

Use Vectors[n] to specify the dimension of a vector variable when it is ambiguous:

Specify non-negative constraints using NonNegativeReals ():

An equivalent form using vector inequality :

Specify integer domain constraints using Integers:

Specify integer domain constraints on vector variables using Vectors[n,Integers]:

Specify non-negative integer domain constraints using NonNegativeIntegers ():

Specify non-positive integer domain constraints using NonPositiveIntegers ():

Specify complex variables using Complexes:

Minimize a real objective with complex variables and complex constraints :

Let . Expanding out the constraints into real components gives the following:

Solve the problem with real-valued objective and complex variables and constraints:

Solve the same problem with real variables and constraints:

Use a quadratic constraint with a Hermitian matrix and real-valued variables:

Use a Hermitian matrix in a constraint with complex variables:

Use a linear matrix inequality constraint with Hermitian or real symmetric matrices:

The variables in linear matrix inequalities need to be real for the sum to remain Hermitian:

Minimize over the intersection of a triangle and a disk :

Get the primal minimizer as a vector:

Get the minimal value:

Plot the solution:

Extract the objective vector:

Extract the conic constraints:

Extract the cone specification in the conic constraints:

Extract the cone dimensions in the conic constraints:

Extract the affine lists in the conic constraints:

The slack for an inequality at the minimizer is given by :

Extract the minimizer and conic constraint affine lists:

Verify that the slack satisfies s={s₀,…,s_k} with a_j.x^*+b_j-s_j=0.

A conic optimization problem in standard form is defined by some authors as minimizing subject to and . To convert to standard form, for each conic constraint , add a variable and corresponding linear equality constraint :

Extract the objective vector, conic constraint affine lists and the conic specifications:

The slack constraints are the same as :

Form the linear equality constraint :

Solve the transformed standard form conic problem:

The "Slack" property allows you to get the values of without doing the actual transformation:

Minimize subject to and :

The dual problem is to maximize subject to :

The primal minimum value and the dual maximum value coincide because of strong duality:

That is the same as having a duality gap of zero. In general, at optimal points:

Construct the dual problem using coefficients extracted from the primal problem:

Extract the objective vector and constraint affine lists:

Get the and :

The dual problem is to maximize subject to :

Get the dual maximum value and dual maximizer directly using solution properties:

The "DualMaximizer" can be obtained with:

The dual maximizer vector partitions match the number and dimensions of the dual cones:

Find the change in optimal value due to constraint perturbations:

Compute the "ConstraintSensitivity":

Consider new constraint where is the perturbation:

The new optimal value can be estimated to be:

Compare to directly solving the perturbed problem:

The optimal value changes according to the signs of the sensitivity elements:

At negative sensitivity element position, a positive perturbation will decrease the optimal value:

At positive sensitivity element position, a positive perturbation will increase the optimal value:

The constraint sensitivity can also be obtained as the negative of the dual maximizer:

"SCS" uses a splitting conic solver method:

"CSDP" is an interior point method for semidefinite problems:

"DSDP" is an alternative interior point method for semidefinite problems:

"IPOPT" is an interior point method for nonlinear problems:

Different methods have different default tolerances, which affects the accuracy and precision:

Compute exact and approximate solutions:

"SCS" has a default tolerance of :

"CSDP", "DSDP" and "IPOPT" have default tolerances of :

When method "SCS" is specified, it is called with the SCS library default tolerance of 10^-3:

With default options, this problem is solved by method "SCS" with tolerance 10^-6:

Use methods "CSDP" or "DSDP" for up to semidefinite constraints:

Solve the problem using method "CSDP":

Solve the problem using method "DSDP":

Use method "IPOPT" to obtain accurate solutions when "CSDP" and "DSDP" are not applicable:

"IPOPT" produces more accurate results than "SCS" but is typically slower:

Compare timing with method "SCS":

The default value of the option PerformanceGoal is $PerformanceGoal:

Use PerformanceGoal"Quality" to get a more accurate result:

Use PerformanceGoal"Speed" to get a result faster, but at the cost of quality:

Compare the timings:

The "Speed" goal gives a less accurate result:

A smaller Tolerance setting gives a more precise result:

Compute the exact minimum value with Minimize:

Compute the error in the minimum value with different Tolerance settings:

Visualize the change in minimum value error with respect to tolerance:

A smaller Tolerance setting gives a more precise answer, but may take longer to compute:

A smaller tolerance takes longer:

The tighter tolerance gives a more precise answer:

Maximize subject to . Solve a maximization problem by negating the objective function:

Negate the primal minimum value to get the corresponding maximal value:

Minimize over a disk centered at with radius . Convert the objective into a linear function with the additional constraint , which is equivalent to :

The disk constraint can also be represented using Norm:

Minimize over a regular pentagon. Convert the objective into a linear function using and the additional constraints :

Minimize . Using auxiliary variable , the objective is transformed to minimize subject to the constraint :

Minimize subject to . Using two auxiliary variables , transform the problem to minimize subject to :

Minimize . Using auxiliary variable , convert the problem to minimize subject to the constraints :

Minimize subject to , where is a nondecreasing function, by instead minimizing . The primal minimizer will remain the same for both problems. Consider minimizing subject to :

The true minimum value can be obtained by applying to the minimum value of :

Minimize over a disk centered at with radius Using the auxiliary variable , the objective is transformed to minimizing with the additional constraint :

The constraint is equivalent to the exponential cone constraint iff :

Minimize over a disk centered at with radius . Using auxiliary variable , convert the problem to minimize subject to the constraint :

The constraint is equivalent to . This can be represented using "PowerCone" by :

Find that minimizes :

Using auxiliary variable , convert the problem to minimize subject to the constraint :

This can be represented using "PowerCone" constraints. Since iff , bounding with where gives :

Find that minimizes the largest eigenvalue of a symmetric matrix that depends linearly on the decision variables , . The problem can be formulated as linear matrix inequality since is equivalent to , where is the eigenvalue of . Define the linear matrix function :

A real symmetric matrix can be diagonalized with an orthogonal matrix so . Hence iff . Since any , taking , , hence iff . Numerically simulate to show that these formulations are equivalent:

The resulting problem:

Run a Monte Carlo simulation to check the plausibility of the result:

Minimize subject to , assuming when . Using the auxiliary variable , the objective is to minimize such that :

Check that implies :

A Schur complement condition says that if , a block matrix iff . Therefore iff . Use Inactive Plus for constructing the constraints to avoid threading:

For quadratic sets , which include ellipsoids, quadratic cones and paraboloids, determine whether , where are symmetric matrices, are vectors and scalars:

Assuming that the sets _i are full dimensional, the S-procedure says that iff there exists some non-negative number such that Visually see that there exists a non-negative :

Since λ≥0, it follows that :

Minimize subject to the constraints :

Using auxiliary variable , the transformed objective is to minimize subject to :

Fit a cubic curve to discrete data such that the first and last points of the data lie on the curve:

Construct the matrix using DesignMatrix:

Define the constraint so that the first and last points must lie on the curve:

Find the coefficients by minimizing . Using auxiliary variable , the transformed objective is to minimize subject to :

Compare fit with data:

Find a robust fit to nonlinear discrete data by minimizing :

Fit the data using the bases . The interpolating function will be :

Since , using auxiliary variables . The problem is transformed to minimize subject to the constraints :

Visualize the fit:

Compare interpolating function with reference function:

Represent a given polynomial in terms of sum-of-squares polynomial :

The objective is to find such that , where is a vector of monomials:

Construct the symmetric matrix :

Find the polynomial coefficients of and and make sure they are equal:

Find the elements of :

The quadratic term , where is a lower-triangular matrix obtained from the Cholesky decomposition of :

Compare the sum-of-squares polynomial to the given polynomial:

Find an regularized fit to complex data by minimizing for a complex :

Construct the matrix using DesignMatrix, for the basis :

Find the coefficients :

Let be the fit defined as a function of the real and imaginary components of :

Visualize the result for the real component of :

Visualize the results for the imaginary component of :

Find the minimum distance between two disks of radius 1 centered at and . Let be a point on disk 1. Let be a point on disk 2. The objective is to minimize . Using auxiliary variable , the transformed objective is to minimize subject to :

Visualize the position of the two points:

The auxiliary variable gives the distance between the points:

Find the radius and center of a minimal enclosing ball that encompasses a given region:

Minimize the radius subject to the constraints :

Visualize the enclosing ball:

The minimal enclosing ball can be found efficiently using BoundingRegion:

Find the plane that separates two non-intersecting convex polygons:

Let be a point on . Let be a point on . The objective is to minimize . Using auxiliary variable , the transformed objective is to minimize subject to :

According to the separating hyperplane theorem, the dual associated with the constraint will give the normal of the hyperplane:

The dual associated with the "NormCone" is:

The hyperplane is constructed as:

Visualize the plane separating the two polygons:

Find the maximum area ellipse parametrized as that can be fitted into a convex polygon:

Each segment of the convex polygon can be represented as intersections of half-planes . Extract the linear inequalities:

Applying the parametrization to the half-planes gives . The term . Thus, the constraints are:

Minimizing the area is equivalent to minimizing , which is equivalent to minimizing :

Convert the parameterized ellipse into the explicit form as :

Find the analytic center of a convex polygon. The analytic center is a point that maximizes the product of distances to the constraints:

Each segment of the convex polygon can be represented as intersections of half-planes . Extract the linear inequalities:

The objective is to maximize . Taking and negating the objective, the transformed objective is :

Using auxiliary variable , the transformed objective is subject to the constraint :

Visualize the location of the center: