Modeling approaches for addressing unrelaxable bound constraints with unconstrained optimization methods

DOI10.1007/s11590-022-01950-1OpenAlexW4281250349MaRDI QIDQ2693782

Stefan M. Wild, Misha Padidar, Jeffrey Larson

Publication date: 24 March 2023

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2205.09627

zbMATH Keywords

optimizationconstrained optimizationmerit functionunrelaxable constraints

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Uses Software

• LANCELOT
• L-BFGS-B
• NOMAD
• L-BFGS
• HOPSPACK
• BOBYQA
• Ipopt
• LBFGS-B
• NLopt
• CUTEst
• GitHub

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A parameter-free unconstrained reformulation for nonsmooth problems with convex constraints
• CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• A Mathematical View of Interior-Point Methods in Convex Optimization
• Introduction to Nonsmooth Optimization
• Algorithm 909
• Interior Point Methods for Nonlinear Optimization
• Algorithm 778: L-BFGS-B
• A limited-memory quasi-Newton algorithm for bound-constrained non-smooth optimization
• Model-Based Derivative-Free Methods for Convex-Constrained Optimization
• Benchmarking Derivative-Free Optimization Algorithms
• A Progressive Barrier for Derivative-Free Nonlinear Programming
• A Merit Function Approach for Direct Search
• Automatic View Synthesis by Image-Domain-Warping
• Mesh Adaptive Direct Search Algorithms for Constrained Optimization
• Introduction to Continuous Optimization

This page was built for publication: Modeling approaches for addressing unrelaxable bound constraints with unconstrained optimization methods