Sciweavers

    18 search results - page 2 / 4
    » Feasible Proofs of Matrix Properties with Csanky's Algorithm
    Sort
    View
    MP
    2006
    73views more  MP 2006»
    On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
    13 years 6 months ago
    On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
    Download  cepac.cheme.cmu.edu
    We present a primal-dual interior-point algorithm with a filter line-search method for nonlinear programming. Local and global convergence properties of this method were analyzed i...
    Andreas Wächter, Lorenz T. Biegler
    claim paper
    Read More »
    SDM
    2009
    SIAM
    167views Data Mining» more  SDM 2009»
    Parallel Pairwise Clustering.
    14 years 3 months ago
    Parallel Pairwise Clustering.
    Download  www.siam.org
    Given the pairwise affinity relations associated with a set of data items, the goal of a clustering algorithm is to automatically partition the data into a small number of homogen...
    Elad Yom-Tov, Noam Slonim
    claim paper
    Read More »
    CDC
    2009
    IEEE
    173views Control Systems» more  CDC 2009»
    Optimality of affine policies in multi-stage robust optimization
    13 years 10 months ago
    Optimality of affine policies in multi-stage robust optimization
    Download  www.mit.edu
    In this paper, we show the optimality of a certain class of disturbance-affine control policies in the context of one-dimensional, constrained, multi-stage robust optimization. Ou...
    Dimitris Bertsimas, Dan Andrei Iancu, Pablo A. Par...
    claim paper
    Read More »
    MOR
    2002
    94views more  MOR 2002»
    The Complexity of Generic Primal Algorithms for Solving General Integer Programs
    13 years 6 months ago
    The Complexity of Generic Primal Algorithms for Solving General Integer Programs
    Download  web.mit.edu
    ngly better objective function value until an optimal solution is reached. From an abstract point of view, an augmentation problem is solved in each iteration. That is, given a fea...
    Andreas S. Schulz, Robert Weismantel
    claim paper
    Read More »
    STACS
    2005
    Springer
    94views Theoretical Computer Science» more  STACS 2005»
    Sampling Sub-problems of Heterogeneous Max-cut Problems and Approximation Algorithms
    14 years 4 days ago
    Sampling Sub-problems of Heterogeneous Max-cut Problems and Approximation Algorithms
    Download  cs-www.cs.yale.edu
    Abstract Abstract. Recent work in the analysis of randomized approximation algorithms for NP-hard optimization problems has involved approximating the solution to a problem by the ...
    Petros Drineas, Ravi Kannan, Michael W. Mahoney
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.