JGO 2010 - PDF Preprint Papers

JGO 2010

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed JGO-2010 Paper

click to vote

JGO
2010

531views more JGO 2010»

Characterizing zero-derivative points

13 years 3 months ago

Download www.springerlink.com

We study smooth functions in several variables with a Lipschitz derivative. It is shown that these functions have the “envelope property”: Around zero-derivative points, and on...

Sanjo Zlobec

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	531	Characterizing zero-derivative points	claim
2	138	Continuous GRASP with a local active-set method for bound-constrained global optimization	claim
3	121	The oracle penalty method	claim
4	119	Convergence rate for consensus with delays	claim
5	117	Machine learning problems from optimization perspective	claim
6	115	Maximum flows and minimum cuts in the plane	claim
7	112	An information global minimization algorithm using the local improvement technique	claim
8	100	On convex relaxations of quadrilinear terms	claim
9	96	Duality and optimality conditions for generalized equilibrium problems involving DC functions	claim
10	96	Solving polynomial least squares problems via semidefinite programming relaxations	claim
11	92	A heuristic method for the minimum toll booth problem	claim
12	89	Iterative regularization algorithms for constrained image deblurring on graphics processors	claim
13	89	Stopping rules in k-adaptive global random search algorithms	claim
14	75	Optimal control of a quasi-variational obstacle problem	claim
15	72	Strong convergence theorem by a hybrid extragradient-like approximation method for variational inequalities and fixed point problems	claim
16	72	On numerical optimization theory of infinite kernel learning	claim
17	70	Semidefinite approximations for quadratic programs over orthogonal matrices	claim
18	69	Solving the problem of packing equal and unequal circles in a circular container	claim
19	69	Partitioning procedure for polynomial optimization	claim
20	61	A new smoothing Newton-type algorithm for semi-infinite programming	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers