OPM, a collection of Optimization Problems in Matlab

Serge Gratton; Philippe TOINT

OPM, a collection of Optimization Problems in Matlab

Serge Gratton, Philippe TOINT

Namur Institute for Complex Systems

Research output: Working paper

30 Downloads (Pure)

Abstract

OPM is a small collection of CUTEst unconstrained and bound-constrained nonlinear optimization problems, which can be used in Matlab for testing optimization algorithms directly (i.e. without installing additional software).

Original language	English
Publisher	Arxiv
Volume	2112.05636
Publication status	Published - 11 Dec 2021

Keywords

optimization
software
test problems

Access to Document

gt23Final published version, 291 KBLicence: Other

3 Article
2 Working paper

Complexity of a Class of First-Order Objective-Function-Free Optimization Algorithms
Gratton, S., Jerad, S. & TOINT, P., 6 Jun 2023, Arxiv, 30 p.
Research output: Working paper

File
Yet another fast variant of Newton's method for nonconvex optimization
Gratton, S., Jerad, S. & TOINT, P., 21 Feb 2023, Arxiv, 26 p.
Research output: Working paper

File
CUTEST: a Constrained and Unconstrained Testing Environment with safe threads
Gould, N. I. M., Orban, D. & Toint, P., 2015, In: Computational Optimization and Applications. 60, 3, p. 545-557 13 p.
Research output: Contribution to journal › Article › peer-review

File
161 Downloads (Pure)

1 Active

ADALGOPT: ADALGOPT - Advanced algorithms in nonlinear optimization
Sartenaer, A. & TOINT, P.
1/01/87 → …
Project: Research Axis

1 Visiting an external academic institution

ENSEEIHT-IRIT
Philippe Toint (Visiting researcher)
21 Nov 2021 → 2 Dec 2021
Activity: Visiting an external institution types › Visiting an external academic institution

Cite this

@techreport{369bf108347c46d9b5a2901d77512759,

title = "OPM, a collection of Optimization Problems in Matlab",

abstract = "OPM is a small collection of CUTEst unconstrained and bound-constrained nonlinear optimization problems, which can be used in Matlab for testing optimization algorithms directly (i.e. without installing additional software).",

keywords = "optimization, software, test problems",

author = "Serge Gratton and Philippe TOINT",

year = "2021",

month = dec,

day = "11",

language = "English",

volume = "2112.05636",

publisher = "Arxiv",

type = "WorkingPaper",

institution = "Arxiv",

}

TY - UNPB

T1 - OPM, a collection of Optimization Problems in Matlab

AU - Gratton, Serge

AU - TOINT, Philippe

PY - 2021/12/11

Y1 - 2021/12/11

N2 - OPM is a small collection of CUTEst unconstrained and bound-constrained nonlinear optimization problems, which can be used in Matlab for testing optimization algorithms directly (i.e. without installing additional software).

AB - OPM is a small collection of CUTEst unconstrained and bound-constrained nonlinear optimization problems, which can be used in Matlab for testing optimization algorithms directly (i.e. without installing additional software).

KW - optimization

KW - software

KW - test problems

M3 - Working paper

VL - 2112.05636

BT - OPM, a collection of Optimization Problems in Matlab

PB - Arxiv

ER -

OPM, a collection of Optimization Problems in Matlab

Abstract

Keywords

Access to Document

Fingerprint

Research output

Complexity of a Class of First-Order Objective-Function-Free Optimization Algorithms

Yet another fast variant of Newton's method for nonconvex optimization

CUTEST: a Constrained and Unconstrained Testing Environment with safe threads

Projects

ADALGOPT: ADALGOPT - Advanced algorithms in nonlinear optimization

Activities

ENSEEIHT-IRIT

Cite this