Search Sciweavers | Sciweavers

We consider the problem of minimizing a polynomial on the hypercube [0, 1]n and derive new error bounds for the hierarchy of semidefinite programming approximations to this problem...

Etienne de Klerk, Monique Laurent

claim paper

Read More »

9

click to vote

SIAMJO
2010

100views more SIAMJO 2010»

Optimality Conditions via Exact Penalty Functions

13 years 1 days ago

Download www.acad.polyu.edu.hk

Abstract: In this paper, we study KKT optimality conditions for constrained nonlinear programming problems and strong and Mordukhovich stationarities for mathematical

K. W. Meng, X. Q. Yang

claim paper

Read More »

8

click to vote

SIAMJO
2010

125views more SIAMJO 2010»

Trading Accuracy for Sparsity in Optimization Problems with Sparsity Constraints

13 years 1 days ago

Download www.cs.huji.ac.il

We study the problem of minimizing the expected loss of a linear predictor while constraining its sparsity, i.e., bounding the number of features used by the predictor. While the r...

Shai Shalev-Shwartz, Nathan Srebro, Tong Zhang

claim paper

Read More »

14

click to vote

SIAMJO
2010

92views more SIAMJO 2010»

Inexact Proximal Point Methods for Variational Inequality Problems

13 years 1 days ago

Download www.maths.unisa.edu.au

We present a new family of proximal point methods for solving monotone variational inequalities. Our algorithm has a relative error tolerance criterion in solving the proximal subp...

Regina Sandra Burachik, Joydeep Dutta

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers