Sciweavers

    MP
    2011
    244views Intelligent Agents» more  MP 2011»
    Fixed point and Bregman iterative methods for matrix rank minimization
    12 years 7 months ago
    Fixed point and Bregman iterative methods for matrix rank minimization
    Download  people.ee.duke.edu
    Shiqian Ma, Donald Goldfarb, Lifeng Chen
    claim paper
    Read More »
    MP
    2011
    190views Intelligent Agents» more  MP 2011»
    Implicit solution function of P0 and Z matrix linear complementarity constraints
    12 years 7 months ago
    Implicit solution function of P0 and Z matrix linear complementarity constraints
    Download  www.polyu.edu.hk
    Abstract. Using the least element solution of the P0 and Z matrix linear complementarity problem (LCP), we define an implicit solution function for linear complementarity constrai...
    Xiaojun Chen, Shuhuang Xiang
    claim paper
    Read More »
    MP
    2011
    250views Intelligent Agents» more  MP 2011»
    An interior-point piecewise linear penalty method for nonlinear programming
    12 years 7 months ago
    An interior-point piecewise linear penalty method for nonlinear programming
    Download  www.corc.ieor.columbia.edu
    We present an interior-point penalty method for nonlinear programming (NLP), where the merit function consists of a piecewise linear penalty function (PLPF) and an 2-penalty functi...
    Lifeng Chen, Donald Goldfarb
    claim paper
    Read More »
    MP
    2011
    185views Intelligent Agents» more  MP 2011»
    Adaptive cubic regularisation methods for unconstrained optimization. Part I: motivation, convergence and numerical results
    12 years 7 months ago
    Adaptive cubic regularisation methods for unconstrained optimization. Part I: motivation, convergence and numerical results
    Download  ftp.numerical.rl.ac.uk
    Coralia Cartis, Nicholas I. M. Gould, Philippe L. ...
    claim paper
    Read More »
    MP
    2011
    218views Intelligent Agents» more  MP 2011»
    Strong KKT conditions and weak sharp solutions in convex-composite optimization
    12 years 7 months ago
    Strong KKT conditions and weak sharp solutions in convex-composite optimization
    Download  www.math.cuhk.edu.hk
    Using variational analysis techniques, we study convex-composite optimization problems. In connection with such a problem, we introduce several new notions as variances of the clas...
    Xi Yin Zheng, Kung Fu Ng
    claim paper
    Read More »
    MP
    2011
    206views Intelligent Agents» more  MP 2011»
    Smoothed analysis of condition numbers and complexity implications for linear programming
    12 years 11 months ago
    Smoothed analysis of condition numbers and complexity implications for linear programming
    Download  www.cs.yale.edu
    We perform a smoothed analysis of Renegar’s condition number for linear programming by analyzing the distribution of the distance to ill-posedness of a linear program subject to...
    John Dunagan, Daniel A. Spielman, Shang-Hua Teng
    claim paper
    Read More »
    MP
    2011
    186views Intelligent Agents» more  MP 2011»
    A warm-start approach for large-scale stochastic linear programs
    12 years 11 months ago
    A warm-start approach for large-scale stochastic linear programs
    Download  www.maths.ed.ac.uk
    Marco Colombo, Jacek Gondzio, Andreas Grothey
    claim paper
    Read More »
    MP
    2011
    234views Intelligent Agents» more  MP 2011»
    Statistical ranking and combinatorial Hodge theory
    12 years 11 months ago
    Statistical ranking and combinatorial Hodge theory
    Download  math.stanford.edu
    We propose a number of techniques for obtaining a global ranking from data that may be incomplete and imbalanced — characteristics that are almost universal to modern datasets co...
    Xiaoye Jiang, Lek-Heng Lim, Yuan Yao, Yinyu Ye
    claim paper
    Read More »
    MP
    2011
    202views Intelligent Agents» more  MP 2011»
    A first-order interior-point method for linearly constrained smooth optimization
    12 years 11 months ago
    A first-order interior-point method for linearly constrained smooth optimization
    Download  www.optimization-online.org
    Abstract: We propose a first-order interior-point method for linearly constrained smooth optimization that unifies and extends first-order affine-scaling method and replicator d...
    Paul Tseng, Immanuel M. Bomze, Werner Schachinger
    claim paper
    Read More »
    MP
    2011
    191views Intelligent Agents» more  MP 2011»
    Null space conditions and thresholds for rank minimization
    12 years 11 months ago
    Null space conditions and thresholds for rank minimization
    Download  pages.cs.wisc.edu
    Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in machine learning, control theory, and discrete geometry. This c...
    Benjamin Recht, Weiyu Xu, Babak Hassibi
    claim paper
    Read More »
    12next ›last »
    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.