CUTEr and SifDec: A constrained and unconstrained testing environment, revisited
The initial release of CUTE, a widely used testing environment for optimization software, was
described by Bongartz, et al.[1995]. A new version, now known as CUTEr, is presented …
described by Bongartz, et al.[1995]. A new version, now known as CUTEr, is presented …
[图书][B] Semismooth Newton methods for variational inequalities and constrained optimization problems in function spaces
M Ulbrich - 2011 - SIAM
This book provides a comprehensive treatment of a very successful class of methods for
solving optimization problems with PDE and inequality constraints as well as variational …
solving optimization problems with PDE and inequality constraints as well as variational …
On the global convergence of a filter--SQP algorithm
A mechanism for proving global convergence in SQP--filter methods for nonlinear
programming (NLP) is described. Such methods are characterized by their use of …
programming (NLP) is described. Such methods are characterized by their use of …
A globally convergent primal-dual interior-point filter method for nonlinear programming
In this paper, the filter technique of Fletcher and Leyffer (1997) is used to globalize the
primal-dual interior-point algorithm for nonlinear programming, avoiding the use of merit …
primal-dual interior-point algorithm for nonlinear programming, avoiding the use of merit …
On the global convergence of an SLP–filter algorithm that takes EQP steps
CM Chin, R Fletcher - Mathematical Programming, 2003 - Springer
A global convergence proof is presented for a class of trust region filter–type methods for
nonlinear programming. Such methods are characterized by their use of the dominance …
nonlinear programming. Such methods are characterized by their use of the dominance …
On the superlinear local convergence of a filter-SQP method
S Ulbrich - Mathematical Programming, 2004 - Springer
Transition to superlinear local convergence is shown for a modified version of the trust-
region filter-SQP method for nonlinear programming introduced by Fletcher, Leyffer, and …
region filter-SQP method for nonlinear programming introduced by Fletcher, Leyffer, and …
5g on the roads: Latency-optimized federated analytics in the vehicular edge
Coordination among vehicular actors becomes increasingly important at the dawn of
autonomous driving. With communication serving as the basis for this process, latency …
autonomous driving. With communication serving as the basis for this process, latency …
Nonlinear programming without a penalty function or a filter
A new method is introduced for solving equality constrained nonlinear optimization
problems. This method does not use a penalty function, nor a filter, and yet can be proved to …
problems. This method does not use a penalty function, nor a filter, and yet can be proved to …
[PDF][PDF] Nonsmooth Newton-like methods for variational inequalities and constrained optimization problems in function spaces
M Ulbrich - Habilitation, Technical University of Munich, Munich, 2002 - researchgate.net
A central theme of applied mathematics is the design of accurate mathematical models for a
variety of technical, financial, medical, and many other applications, and the development of …
variety of technical, financial, medical, and many other applications, and the development of …
A penalty-free infeasible approach for a class of nonsmooth optimization problems over the Stiefel manifold
Inspired by penalty-free approaches for smooth optimization problems, we propose a
sequential linearized proximal gradient method (SLPG) for a class of optimization problems …
sequential linearized proximal gradient method (SLPG) for a class of optimization problems …