Modeling approaches for addressing unrelaxable bound constraints with unconstrained optimization methods

DOI10.1007/S11590-022-01950-1MaRDI QIDQ2693782zbMATH OpenOpenAlexFDO

Authors Jeffrey Larson, Misha Padidar, Stefan M. Wild

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

constrained optimizationmerit functionoptimizationunrelaxable constraints

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Recommendations

• A model-hybrid approach for unconstrained optimization problems
• scientific article; zbMATH DE number 4202040
• scientific article; zbMATH DE number 4099044
• scientific article; zbMATH DE number 778131
• An approach to the solution of nonlinear unconstrained optimization problems
• A new method for solving unconstrained optimization problems
• A new method for unconstrained optimization problem
• scientific article; zbMATH DE number 779149
• Methods of unconstrained optimization
• scientific article; zbMATH DE number 3932802

Cites work

• A limited-memory quasi-Newton algorithm for bound-constrained non-smooth optimization
• A mathematical view of interior-point methods in convex optimization
• A merit function approach for direct search
• A parameter-free unconstrained reformulation for nonsmooth problems with convex constraints
• A progressive barrier for derivative-free nonlinear programming
• Algorithm 778: L-BFGS-B
• Algorithm 909: NOMAD: nonlinear optimization with the MADS algorithm
• Automatic View Synthesis by Image-Domain-Warping
• Benchmarking Derivative-Free Optimization Algorithms
• CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
• scientific article; zbMATH DE number 3914081 (Why is no real title available?)
• scientific article; zbMATH DE number 46303 (Why is no real title available?)
• scientific article; zbMATH DE number 1243473 (Why is no real title available?)
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• scientific article; zbMATH DE number 5060482 (Why is no real title available?)
• Interior Point Methods for Nonlinear Optimization
• Introduction to continuous optimization
• Introduction to nonsmooth optimization. Theory, practice and software
• Mesh Adaptive Direct Search Algorithms for Constrained Optimization
• Model-based derivative-free methods for convex-constrained optimization
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming

Cited in

(1)

• Modeling Approaches for Addressing Simple Unrelaxable Constraints with Unconstrained Optimization Methods

Describes a project that uses

Uses Software

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2693782)