A BFGS-SQP method for nonsmooth, nonconvex, constrained optimization and its evaluation using relative minimization profiles
From MaRDI portal
(Redirected from Publication:5268896)
Recommendations
- A sequential quadratic programming algorithm for nonconvex, nonsmooth constrained optimization
- A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization
- Publication:4351591
- Nonsmooth optimization via quasi-Newton methods
- A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees
Cites work
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- scientific article; zbMATH DE number 2212009 (Why is no real title available?)
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- A line search exact penalty method using steering rules
- A noninteracting control strategy for the robust output synchronization of linear heterogeneous networks
- A sequential quadratic programming algorithm for nonconvex, nonsmooth constrained optimization
- Active Sets, Nonsmoothness, and Sensitivity
- Algorithms for the computation of the pseudospectral radius and the numerical radius of a matrix
- An Exact Penalization Viewpoint of Constrained Optimization
- Assessing the reliability of general-purpose inexact restoration methods
- Benchmarking Derivative-Free Optimization Algorithms
- Benchmarking optimization software with performance profiles.
- Calmness and Exact Penalization
- Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
- Evaluating bound-constrained minimization software
- Globally convergent limited memory bundle method for large-scale nonsmooth optimization
- Methods of descent for nondifferentiable optimization
- Nonparametric and semiparametric estimation of the receiver operating characteristic curve
- Nonsmooth optimization via quasi-Newton methods
- Practical augmented Lagrangian methods for constrained optimization
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- Some regularity results for the pseudospectral abscissa and pseudospectral radius of a matrix
- Steering exact penalty methods for nonlinear programming
Cited in
(39)- Numerical methods for biomembranes: conforming subdivision methods versus non-conforming PL methods
- A subspace framework for \(\mathcal{H}_\infty \)-norm minimization
- Proximal gradient \(\mathcal{VU}\)-method with superlinear convergence for nonsmooth convex optimization
- Analysis of the gradient method with an Armijo-Wolfe line search on a class of non-smooth convex functions
- A new sequential optimality condition for constrained nonsmooth optimization
- On stable parameter estimation and forecasting in epidemiology by the Levenberg-Marquardt algorithm with Broyden's rank-one updates for the Jacobian operator
- SOBMOR: Structured Optimization-Based Model Order Reduction
- An SQP method for minimization of locally Lipschitz functions with nonlinear constraints
- Training recurrent neural networks by sequential least squares and the alternating direction method of multipliers
- Reinforced concrete seismically-excited frame design with a new mixed \(H_2/H_{\infty}\) optimization approach
- Nearest \(\Omega \)-stable matrix via Riemannian optimization
- Comparing (empirical-Gramian-based) model order reduction algorithms
- Manifold sampling for optimization of nonconvex functions that are piecewise linear compositions of smooth components
- On reduced input-output dynamic mode decomposition
- On the real stability radius of sparse systems
- On a minimum enclosing ball of a collection of linear subspaces
- Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions
- Optimization-based parametric model order reduction via \(\mathcal{H}_2\otimes\mathcal{L}_2\) first-order necessary conditions
- On TSVD regularization for a Broyden-type algorithm
- Finding the nearest \(\mathbf{\Omega}\)-stable pencil with Riemannian optimization
- Minimization of the pseudospectral abscissa of a quadratic matrix polynomial
- Automated data-driven selection of the hyperparameters for total-variation-based texture segmentation
- Fast optimization of viscosities for frequency‐weighted damping of second‐order systems
- Approximate residual-minimizing shift parameters for the low-rank ADI iteration
- Large-scale minimization of the pseudospectral abscissa
- Direct search nonsmooth constrained optimization via rounded ℓ1 penalty functions
- On the convergence analysis of a penalty algorithm for nonsmooth optimization and its performance for solving hard-sphere problems
- A Sequential Quadratic Programming Algorithm for Nonsmooth Problems with Upper- \({\boldsymbol{\mathcal{C}^2}}\) Objective
- Manifold sampling for optimizing nonsmooth nonconvex compositions
- On the use of third-order models with fourth-order regularization for unconstrained optimization
- An approach for robust PDE-constrained optimization with application to shape optimization of electrical engines and of dynamic elastic structures under uncertainty
- A primal nonsmooth reformulation for bilevel optimization problems
- Fast computation of \(\mathrm{sep}_\lambda\) via interpolation-based globality certificates
- A nonsmooth trust-region method for locally Lipschitz functions with application to optimization problems constrained by variational inequalities
- Multifidelity Robust Controller Design with Gradient Sampling
- Balanced truncation model reduction with a priori error bounds for LTI systems with nonzero initial value
- Delay-based stabilisation and strong stabilisation of LTI systems by nonsmooth constrained optimisation
- A subspace framework for \(\mathcal{L}_{\infty}\) model reduction
- Modal decomposition of flow data via gradient-based transport optimization
This page was built for publication: A BFGS-SQP method for nonsmooth, nonconvex, constrained optimization and its evaluation using relative minimization profiles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5268896)
