Search
Code Directory
 ASP
 ASP.NET
 C/C++
 CFML
 CGI/PERL
 Delphi
 Development
 Flash
 HTML
 Java
 JavaScript
 Pascal
 PHP
 Python
 SQL
 Tools
 Visual Basic & VB.NET
 XML
New Code
.Net Runtime Library for Delphi 6.0.4.0
Scimbo 1.64
AnyMap JS Maps 8.4.2
GetOrgChart 2.5.3
AnyChart JS Charts and Dashboards 8.4.2
OrgChart JS 3.8.0
dbForge Compare Bundle for MySQL 8.1
dbForge Search for SQL Server 2.3
Database Workbench Pro 5.5.0
Luxand FaceSDK 7.0
SSIS Data Flow Components 1.10
Entity Developer Professional 6.3
dbForge Index Manager for SQL Server 1.9
dbForge Data Generator For MySQL 2.2
Magento Australia Post eParcel Extension 1.0
Top Code
PHP Point of sale 10.0
MATLAB Support Package for Arduino (aka ArduinoIO Package) 1.0
Betting system 6.x-1.x-dev
Java-2-Pseudo 1.0
Faculty Evaluation System 1.1
TeeBI for RAD Studio Suite 2017
Cuckoo Search (CS) Algorithm 1.0
Student Information Management System 1.0
Java/RTR 1.0
JEDI Database Desktop 27012002
Mind Fighter 1.1
JAC (Java Asn.1 Compiler) 3.0
000-516 Free Test Exam Questions 10.0
ICDoctorAppointment - Doctor Appointment Script 1.2
CONTRAST CONTROLLER 1.0
Top Rated
Deals and Discounts Website Script 1.0.2
ADO.NET Provider for ExactTarget 1.0
Solid File System OS edition 5.1
Classified Ad Lister 1.0
Aglowsoft SQL Query Tools 8.2
ICPennyBid Penny Auction Script 4.0
PHP Review Script 1.0
ATN Resume Finder 2.0
ATN Site Builder 3.0
Availability Booking Calendar PHP 1.0
PHP GZ Blog Script 1.1
ATN Jobs Software 4.0
ATN Mall 2.0
WeBuilder 2015 13.3
PHP Digital Download Script 1.0.4
quadprog2 - convex QP solver 1.0
File ID: 79229






quadprog2 - convex QP solver 1.0
Download quadprog2 - convex QP solver 1.0http://www.mathworks.comReport Error Link
License: Freeware
File Size: 30.7 KB
Downloads: 17
Submit Rating:
quadprog2 - convex QP solver 1.0 Description
Description: QUADPROG2 - Convex Quadratic Programming Solver
Featuring the SOLVOPT freeware optimizer

New for version 1.1:
* Significant speed improvement
* Geometric Preconditioning
* Improved Error Checking

USAGE:
[x,v] = quadprog2(H,f,A,b)
[x,v] = quadprog2(H,f,A,b,guess)
[x,v,opt] = ...

Minimizes the function v = 0.5*x'*H*x + f*x
subject to the constraint A*x <= b.
Initial guess is optional.

("opt" returns SOLVOPT data for advanced use. Details are available in
the SOLVOPT documentation at the website identified below.)

Notes:
(1) For a problem with 100 variables and 300 constraints, you will
often get a result in under 5 seconds. However, sometimes
the optimizer has to work longer (see below) for difficult
optimizations. Alerts are provided. (Note: The calculation
time is more sensitive to the number of variables than it is
to the number of contraints.)
(2) Geometric preconditioning is undertaken for 10 or more
dimensions to greatly reduce calculation time. (With fewer
than 10 dimensions, there is negligible benefit, so the
preconditioning calculations are omitted.)
(3) Geometric preconditioning can impair the convergence of some
difficult optimizations. When this occurs, the optimization
is attempted again without the preconditioning.
(4) x and guess are column vectors. f is a row vector.
They will be converted if necessary.
(5) This m-file incorporates the SOLVOPT version 1.1 freeware
optimizer, which has been wholly reproduced, except for
a few slight modifications for convenience in parameter passing.
(6) SolvOpt is a general nonlinear local optimizer,
written by Alexei Kuntsevich & Franz Kappel, and
is available (as of this writing) as freeware from:
http://www.uni-graz.at/imawww/kuntsevich/solvopt/
(7) This Matlab function requires a convex QP problem
with a positive-definite symmetric matrix H.
This is a somewhat trivial application of
a general solver like SOLVOPT, but the use of precomputed
gradient vectors herein makes the solution fast enough
to warrant use.
(8) Any local solution of a convex QP is also a global solution.
Hence, your results will be globally optimal.
(9) Relative precision in the objective function is set to 1e-6.
(10) Absolute precision in constraint violation is 1e-6 or better.
(11) This program does not require the Optimization Toolbox
(12) ver 1.0: intial writing, Michael Kleder, June 2005
(13) ver 1.1: geometric preconditioning, Michael Kleder, July 2005

EXAMPLE:
% Convex QP with 100 variables and 300 constraints:
n = 100;
c = 300;
H = rand(n);
H=H*H';
f=rand(1,n);
A=rand(c,n)*2-1;
b=ones(c,1);
tic
x = quadprog2(H,f,A,b)
toc

License: Freeware

Related: alexei, kuntsevich, franz, optimizerwritten, Local, solvopt, General, nonlinear, kappel, andis, convex, problemwith, positivedefinite, requires, matlab, Writing, fromhttpwwwunigrazatimawwwkuntsevichsolvopt, passing, Parameter, converted

O/S:BSD, Linux, Solaris, Mac OS X

File Size: 30.7 KB

Downloads: 17



More Similar Code

SVMs are a bit tricky. In this case, we show a linear SVM and illustrate its behaviour on some 2D data. This should be great for getting to grips with maximising geometric margins, support vectors, and the optimisation involved in computing an optimal separating hyperplane.

Data can be generated randomly (uniformly or from separate gaussians) over the 2D space, and an SVM or perceptron can be trained to find a separating line. Data...



It's a simple solver of the problem of Hanoi Tower with a minimal GUI written in wxPython. It can handle just 10 plates, due to windows size..however it's very simple to modify this and the 'pure' solver is not affected by this limitation



Even if totally m-coded, this routine is particularly fast in computing convex hull of 2D points. In many cases seems to be much faster than the matlab library routine. The main reason is that, differently from convhull, this algorithm jumps the...



Easy to use Clebsch-Gordan coefficient solver for adding two angular momentums in Quantum Mechanics. This tool is created for my Quantum Mechanics II course offered by Dr. Thompson in Summer of 2007.

[Instruction]
Execute...



This submission contains an interface to a LBFGS solver for unconstrainted minimization problems of the form

min_{x} f(x) + c*|tilde{x}|,

where x are the parameters, f is a scalar valued real function, c is a positive scalar...



"Pegasos-Primal Estimated sub-Gradient SOlver for SVM"
is a primal optimization problem solver in Support Vector Machine classification algorithm.
See the paper for further reference.



Using ODE45 solver read from a data.mat file the accelerometer and gyroscope(body) and solve



A recursive version of the fast solver to provide more tweak handles for those wish to push the 3-minute limits



Math Solver II is a scientific calculator. Math Solver II includes a step-by-step solution for any mathematical expression, to make work/homework more fun and easy. Also includes a Simple Mode, for smaller size on desktop.Features:Scientific...



Anagram Solver is a free and powerful anagram generator and anagram solver. Experiment and make your own anagrams, use to create and solve crosswords, scrabble, puzzles and wordplay!

An anagram is a word or phrase spelled by rearranging...

User Review for quadprog2 - convex QP solver
- required fields
     

Please enter text on the image