**Reading**PAGE

### Peer Evaluation activity

Downloads | 14 |

Views | 75 |

Collected by | 1 |

### Total impact ?

#### Send a

### Jean has...

Trusted | 0 |

Reviewed | 0 |

Emailed | 0 |

Shared/re-used | 0 |

Discussed | 0 |

Invited | 0 |

Collected | 8 |

### This was brought to you by:

# Followblock this user
Jean Lasserre
*Trusted member*

## Principal Research Fellow

LAAS-CNRS, Toulouse, France

# On representations of the feasible set in convex optimization

## Oh la la

Your session has expired but *don’t worry*, your message

has been saved.Please log in and we’ll bring you back

to this page. You’ll just need to click “Send”.

**Your evaluation**is of great value to our authors and readers. Many thanks for your time.

Your **mailing list** is currently empty.

It will build up as you send messages

and links to your peers.

__No one__besides you has access to this list.

Enter the e-mail addresses of your recipients in the box below.

__Note__: Peer Evaluation will NOT store these email addresses log inYour message has been sent.

### Description

New Full text for this article was not available? Send a request to the author(s).

**Title**: On representations of the feasible set in convex optimization

**Author(s)**: Jean B Lasserre

**Abstract**: We consider the convex optimization problem min f(x) : gj(x)leq 0, j=1,...,m where f is convex, the feasible set K is convex and Slater's condition holds, but the functions gj are not necessarily convex. We show that for any representation of K that satisfies a mild nondegeneracy assumption, every minimizer is a Karush-Kuhn-Tucker (KKT) point and conversely every KKT point is a minimizer. That is, the KKT optimality conditions are necessary and sufficient as in convex programming where one assumes that the gj are convex. So in convex optimization, and as far as one is concerned with KKT points, what really matters is the geometry of K and not so much its representation.

**Subject**: unspecified

**Area**: Other

**Language**: English

**Year**: 2009

Affiliations : |
LAAS-CNRS, Toulouse, France |

**Journal**: Optimization Letters

**Volume**: 4

**Issue**: 1

**Pages**: 1-5

**Url**: http://arxiv.org/abs/0911.1182

### Leave a comment

### This contribution has not been reviewed yet. review?

You may receive the Trusted member label after :

• Reviewing **10 uploads**, whatever the media type.

• Being trusted by **10 peers**.

• If you are blocked by **10 peers** the "Trust label" will be suspended from your page. We encourage you to contact the administrator to contest the suspension.

#### Please select an affiliation to sign your evaluation:

#### Please select an affiliation:

### Jean's * Peer Evaluation activity*

Downloads | 14 |

- 4A Trace Inequality for Matrix Product
- 4Approximation Schemes for Infinite Linear Programs
- 1Moment and SDP relaxation techniques for smooth approximations of problems involving nonlinear differential equations
- 1Convergent LMI relaxations for non-convex optimization over polynomials in control
- 1A Laplace transform algorithm for the volume of a convex polytope
- 1Nonlinear optimal control synthesis via occupation measures
- 1Polynomial Programming: LP-Relaxations Also Converge
- 1A Formula for Singular Perturbations of Markov Chains

Views | 75 |

- 6Integration of lotsizing and scheduling decisions in a job-shop
- 4Approximation Schemes for Infinite Linear Programs
- 3Nonlinear optimal control synthesis via occupation measures
- 3A Trace Inequality for Matrix Product
- 2Moments and sums of squares for polynomial optimization and related problems
- 2An Explicit Exact SDP Relaxation for Nonlinear 0-1 Programs
- 2A sum of squares approximation of nonnegative polynomials
- 2Lp-norms, Log-barriers and Cramer transform in Optimization
- 2Approximate volume and integration for basic semi-algebraic sets
- 2The linear programming approach
- 1A semidefinite programming approach to the generalized problem of moments
- 1Duality and a Farkas lemma for integer programs
- 1Robust global optimization with polynomials
- 1Moment and SDP relaxation techniques for smooth approximations of problems involving nonlinear differential equations
- 1On parameter-dependent Lyapunov functions for robust stability of linear systems
- 1Exploiting symmetries in SDP-relaxations for polynomial optimization
- 1Inverse polynomial optimization
- 1Convergent LMI relaxations for non-convex optimization over polynomials in control
- 1GloptiPoly 3: moments, optimization and semidefinite programming
- 1An Explicit Equivalent Positive Semidefinite Program for Nonlinear 0-1 Programs
- 1Linear and Integer Programming vs Linear Integration and Counting
- 1A "joint+marginal" approach to parametric polynomial optimization
- 1GloptiPoly : Global Optimization over Polynomials with Matlab and SeDuMi Getting started
- 1Semidefinite Programming vs. LP Relaxations for Polynomial Programming
- 1On the importance of sequencing decisions in production planning and scheduling
- 1Approximate Volume and Integration for Basic Semialgebraic Sets
- 1Discrete-Time Stochastic Optimal Control via Occupation Measures and Moment Relaxations
- 1Nonlinear optimal control : Numerical approximations via moments and LMI-relaxations
- 1Solving Global Optimization Problems over Polynomials with GloptiPoly 2 . 1
- 1Representation of nonnegative convex polynomials
- 1A Laplace transform algorithm for the volume of a convex polytope
- 1Semidefinite Characterization and Computation of Zero-Dimensional Real Radical Ideals
- 1Nonlinear optimal control via occupation measures and LMI-relaxations
- 1A new look at nonnegativity on closed sets and polynomial optimization
- 1An Integrated Approach in Production Planning and Scheduling
- 1Sufficient conditions for a real polynomial to be a sum of squares
- 1Certificates of convexity for basic semi-algebraic sets
- 1On representations of the feasible set in convex optimization
- 1Convexity in semi-algebraic geometry and polynomial optimization
- 1Integration on a convex polytope
- 1Explicit Formula for Counting Lattice Points of Polyhedra
- 1Hierarchical scheduling for decision support
- 1SOS approximation of polynomials nonnegative on an algebraic set
- 1Polynomial Programming: LP-Relaxations Also Converge
- 1S.o.s. approximation of polynomials nonnegative on a real algebraic set
- 1Solving Nonconvex Optimization Problems
- 1Bounds on measures satisfying moment conditions
- 1The Multi-Dimensional Version of ^b x^p dx
- 1The Multi-Dimensional Version of ^b x^p dx
- 1Optimisation globale et théorie des moments
- 1Weak convergences of probability measures: a uniform principle
- 1Invariant probabilities for Markov chains on a metric space f P ( x , B ) o ( dx )
- 1A Formula for Singular Perturbations of Markov Chains
- 1A NEW LOOK AT NONNEGATIVITY ON CLOSED SETS AND arXiv : 1009 . 0125v1 [ math . OC ] 1 Sep 2010
- 1arXiv : 1103 . 3284v1 [ math . OC ] 16 Mar 2011
- 1Denumerable State Nonhomogeneous Markow Decision Processes
- 1Aggregate model and decomposition method for mid-term production planning

Collected by | 1 |

- FJean Lasserre,
*Principal Research Fellow*, LAAS-CNRS, Toulouse, France.

### Jean* has...*

Trusted | 0 |

Reviewed | 0 |

Emailed | 0 |

Shared/re-used | 0 |

Discussed | 0 |

Invited | 0 |

Collected | 8 |

- Jean Lasserre,
*Principal Research Fellow*, LAAS-CNRS, Toulouse, France.

## Full Text request

### Your request will be sent.

Please enter your email address to be notified

when this article becomes available

**Your email**