A parameter-free unconstrained reformulation for nonsmooth problems with convex constraints
type: Item
instance of: scholarly article
title: A parameter-free unconstrained reformulation for nonsmooth problems with convex constraints
zbMATH Open document ID: 1473.90160
author: Giulio Galvan
author: Stefano Lucidi
author: Marco Sciandrone
published in: Computational Optimization and Applications
publication date: 2021-08-09T00:00:00Z
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 7379932
zbMATH Keywords: nonsmooth constrained optimization
zbMATH Keywords: derivative-free
describes a project that uses: SDBOX
describes a project that uses: NOMAD
describes a project that uses: SDPEN
describes a project that uses: DFL
describes a project that uses: DFBOX_IMPR
describes a project that uses: OrthoMADS
describes a project that uses: DFN
describes a project that uses: GitHub
MaRDI profile type: Publication
full work available at URL: s10589-021-00296-1
OpenAlex ID: W3174389633
cites work: OrthoMADS: A Deterministic MADS Instance with Orthogonal Directions
cites work: Pattern search in the presence of degenerate linear constraints
cites work: Erratum: Mesh Adaptive Direct Search Algorithms for Constrained Optimization
cites work: Mesh Adaptive Direct Search Algorithms for Constrained Optimization
cites work: A Progressive Barrier for Derivative-Free Nonlinear Programming
cites work: Derivative-Free and Blackbox Optimization
cites work: Q4209222
cites work: Delaunay-based derivative-free optimization via global surrogates. II: Convex constraints
cites work: Q3996569
cites work: A Linesearch-Based Derivative-Free Approach for Nonsmooth Constrained Optimization
cites work: Global convergence and stabilization of unconstrained minimization methods without derivatives
cites work: Test examples for nonlinear programming codes
cites work: `` Direct Search'' Solution of Numerical and Statistical Problems
cites work: Q4715202
cites work: Algorithm 909
cites work: Pattern Search Algorithms for Bound Constrained Minimization
cites work: Pattern Search Methods for Linearly Constrained Minimization
cites work: A Globally Convergent Augmented Lagrangian Pattern Search Algorithm for Optimization with General Constraints and Simple Bounds
cites work: Sequential Penalty Derivative-Free Methods for Nonlinear Constrained Optimization
cites work: A derivative-free algorithm for bound constrained optimization
cites work: On the Global Convergence of Derivative-Free Methods for Unconstrained Optimization
cites work: Objective-derivative-free methods for constrained optimization
cites work: Benchmarking Derivative-Free Optimization Algorithms
cites work: More test examples for nonlinear programming codes
cites work: Uniformly distributed sequences with an additional uniform property
DOI: 10.1007/S10589-021-00296-1
Recommended article: Unconstrained optimization reformulations of variational inequality problems
Recommended article: Unconstrained optimization reformulation of the generalized nonlinear complementarity problem and related method
Recommended article: A parameter-free multiplier method for constrained minimization problems
Recommended article: Unconstrained methods for nonsmooth nonlinear complementarity problems
Recommended article: Q3647560
Recommended article: A Smooth Inexact Penalty Reformulation of Convex Problems with Linear Constraints
Recommended article: An unconstrained smooth minimization reformulation of the second-order cone complementarity problem
Recommended article: Q3654522
Recommended article: Q5376376
Recommended article: An approach to solving convex programs with nonsmooth objectives
description: scientific article; zbMATH DE number 7379932