Now showing items 1-3 of 3
A Primal-Dual Interior-Point Method for Nonconvex Optimization with Multiple Logarithmic Barrier Parameters and with Strong Convergence Properties
It is observed that an algorithm proposed in the 1980s for thesolution of nonconvex constrained optimization problems is in fact aprimal-dual logarithmic barrier interior-point method closely related tomethods under current ...
Feasible Sequential Quadratic Programming for Finely Discretized Problems from SIP
A sequential Quadratic Programming algorithm designed to efficiently solve nonlinear optimization problems with many inequality constraints, e.g. problems arising from finely discretized Semi-Infinite Programming, is ...
User's Guide for CFSQP Version 2.0: A C Code for Solving (Large Scale) Constrained Nonlinear (Minimax) Optimization Problems, Generating Iterates Satisfying All Inequality Constraints
CFSQP is a set of C functions for the minimization of the maximum of a set of smooth objective functions (possibly a single one) subject to general smooth constraints. If the initial guess provided by the user is infeasible ...