Publication

Conjectures on an algorithm for convex parametric quadratic programs

Colin Neil Jones
2004
Report or working paper

Abstract

An algorithm for convex parametric QPs is studied. The algorithm explores the parameter space by stepping a sufficiently small distance over the facets of each critical region and thereby identifying the neighboring regions. Some conjectures concerning this algorithm and the structure of the solution of a parametric QP are presented.

Official source

https://infoscience.epfl.ch/record/169766?ln=en

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Conjectures on an algorithm for convex parametric quadratic programs

Graph Chatbot

Chat with Graph Search

Hybrid Flock - Formation Control Algorithms

Actuator Placement under Structural Controllability using Forward and Reverse Greedy Algorithms

Learning to Play Sequential Games versus Unknown Opponents

Actuator Placement under Structural Controllability using Forward and Reverse Greedy Algorithms

Learning to Play Sequential Games versus Unknown Opponents

Hybrid Flock - Formation Control Algorithms