MP 2002 - PDF Preprint Papers

MP 2002

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed MP-2002 Paper

click to vote

MP
2002

195views more MP 2002»

Nonlinear rescaling vs. smoothing technique in convex optimization

14 years 3 days ago

Download cs.gmu.edu

We introduce an alternative to the smoothing technique approach for constrained optimization. As it turns out for any given smoothing function there exists a modification with part...

Roman A. Polyak

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	195	Nonlinear rescaling vs. smoothing technique in convex optimization	claim
2	183	On splittable and unsplittable flow capacitated network design arc-set polyhedra	claim
3	176	UOBYQA: unconstrained optimization by quadratic approximation	claim
4	165	A feasible semismooth asymptotically Newton method for mixed complementarity problems	claim
5	143	Extending Dantzig's bound to the bounded multiple-class binary Knapsack problem	claim
6	113	A note on sensitivity of value functions of mathematical programs with complementarity constraints	claim
7	110	Robust optimization - methodology and applications	claim
8	105	Local behavior of an iterative framework for generalized equations with nonisolated solutions	claim
9	103	Detecting Jacobian sparsity patterns by Bayesian probing	claim
10	101	Componentwise fast convergence in the solution of full-rank systems of nonlinear equations	claim
11	96	On capacitated network design cut-set polyhedra	claim
12	95	The mathematics of playing golf, or: a new class of difficult non-linear mixed integer programs	claim
13	93	Conditioning of convex piecewise linear stochastic programs	claim
14	86	Multistars, partial multistars and the capacitated vehicle routing problem	claim
15	85	Generalized Goal Programming: polynomial methods and applications	claim
16	85	From fluid relaxations to practical algorithms for job shop scheduling: the makespan objective	claim
17	84	A decomposition procedure based on approximate Newton directions	claim
18	84	The volume algorithm revisited: relation with bundle methods	claim
19	77	Polyhedral results for the edge capacity polytope	claim
20	72	A connection between cutting plane theory and the geometry of numbers	claim
21	66	A faster capacity scaling algorithm for minimum cost submodular flow	claim
22	65	Convex optimization problems involving finite autocorrelation sequences	claim
23	64	Improved sorting-based procedure for integer programming	claim
24	63	Dynamic allocation indices for restless projects and queueing admission control: a polyhedral approach	claim
25	54	A spectral bundle method with bounds	claim
26	48	Maximum stable set formulations and heuristics based on continuous optimization	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers