• DocumentCode
    1819339
  • Title

    Imputing a convex objective function

  • Author

    Keshavarz, Arezou ; Wang, Yang ; Boyd, Stephen

  • Author_Institution
    Electr. Eng. Dept., Stanford Univ., Stanford, CA, USA
  • fYear
    2011
  • fDate
    28-30 Sept. 2011
  • Firstpage
    613
  • Lastpage
    619
  • Abstract
    We consider an optimizing process (or parametric optimization problem), i.e., an optimization problem that depends on some parameters. We present a method for imputing or estimating the objective function, based on observations of optimal or nearly optimal choices of the variable for several values of the parameter, and prior knowledge (or assumptions) about the objective. Applications include estimation of consumer utility functions from purchasing choices, estimation of value functions in control problems, given observations of an optimal (or just good) controller, and estimation of cost functions in a flow network.
  • Keywords
    convex programming; consumer utility function; control problem; convex objective function; cost function; flow network; optimizing process; parametric optimization problem; purchasing choices; value function; Convex functions; Cost function; Dynamic programming; Heuristic algorithms; Process control; Stochastic processes;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Intelligent Control (ISIC), 2011 IEEE International Symposium on
  • Conference_Location
    Denver, CO
  • ISSN
    2158-9860
  • Print_ISBN
    978-1-4577-1104-6
  • Electronic_ISBN
    2158-9860
  • Type

    conf

  • DOI
    10.1109/ISIC.2011.6045410
  • Filename
    6045410