Sciweavers

    1477 search results - page 21 / 296
    » Random Convex Programs
    Sort
    View
    SIAMJO
    2008
    79views more  SIAMJO 2008»
    A Class of Interior Proximal-Like Algorithms for Convex Second-Order Cone Programming
    13 years 8 months ago
    A Class of Interior Proximal-Like Algorithms for Convex Second-Order Cone Programming
    Download  math.ntnu.edu.tw
    Shaohua Pan, Jein-Shan Chen
    claim paper
    Read More »
    TRIER
    1998
    76views Modeling And Simulation» more  TRIER 1998»
    Proximal Interior Point Approach for Solving Convex Semi-infinite Programming Problems
    13 years 8 months ago
    Proximal Interior Point Approach for Solving Convex Semi-infinite Programming Problems
    Download  www.mathematik.uni-trier.de
    Alexander Kaplan, Rainer Tichatschke
    claim paper
    Read More »
    CORR
    2010
    Springer
    71views Education» more  CORR 2010»
    Rational Convex Programs, Their Feasibility, and the Arrow-Debreu Nash Bargaining Game
    13 years 6 months ago
    Rational Convex Programs, Their Feasibility, and the Arrow-Debreu Nash Bargaining Game
    Download  www.cc.gatech.edu
    Vijay V. Vazirani
    claim paper
    Read More »
    TSP
    2012
    353views Artificial Intelligence» more  TSP 2012»
    Robust Multicast Beamforming for Spectrum Sharing-Based Cognitive Radios
    12 years 4 months ago
    Robust Multicast Beamforming for Spectrum Sharing-Based Cognitive Radios
    Download  www.math.hkbu.edu.hk
    Abstract—We consider a robust downlink beamforming optimization problem for secondary multicast transmission in a multiple-input multiple-output (MIMO) spectrum sharing cognitive...
    Yongwei Huang, Qiang Li, Wing-Kin Ma, Shuzhong Zha...
    claim paper
    Read More »
    SODA
    2012
    ACM
    217views Algorithms» more  SODA 2012»
    Deterministic construction of an approximate M-ellipsoid and its applications to derandomizing lattice algorithms
    11 years 11 months ago
    Deterministic construction of an approximate M-ellipsoid and its applications to derandomizing lattice algorithms
    Download  www2.isye.gatech.edu
    We give a deterministic O(log n)n -time and space algorithm for the Shortest Vector Problem (SVP) of a lattice under any norm, improving on the previous best deterministic nO(n) -...
    Daniel Dadush, Santosh Vempala
    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.