A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization
From MaRDI portal
Recommendations
- A sequential quadratic programming algorithm for nonconvex, nonsmooth constrained optimization
- An adaptive gradient sampling algorithm for non-smooth optimization
- Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees
Cites work
- scientific article; zbMATH DE number 780774 (Why is no real title available?)
- A New Superlinearly Convergent Strongly Subfeasible Sequential Quadratic Programming Algorithm for Inequality-Constrained Optimization
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
- A computational comparison of some non-linear programs
- A computationally efficient feasible sequential quadratic programming algorithm
- A feasible directions method for nonsmooth convex optimization
- A line search exact penalty method using steering rules
- A nonderivative version of the gradient sampling algorithm for nonsmooth nonconvex optimization
- A sequential quadratic programming algorithm for nonconvex, nonsmooth constrained optimization
- An Algorithm for the Inequality-Constrained Discrete Min--Max Problem
- An Infeasible Bundle Method for Nonsmooth Convex Constrained Optimization without a Penalty Function or a Filter
- An adaptive gradient sampling algorithm for non-smooth optimization
- Combined phase I—phase II methods of feasible directions
- Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
- Exact penalty functions in nonlinear programming
- Globally convergent cutting plane method for nonconvex nonsmooth minimization
- Methods of descent for nondifferentiable optimization
- New sequential quadratically-constrained quadratic programming method of feasible directions and its convergence rate
- On combining feasibility, descent and superlinear convergence in inequality constrained optimization
- Optimization and nonsmooth analysis
- Optimization of lipschitz continuous functions
- Pseudospectral Components and the Distance to Uncontrollability
- Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions
- Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions
- Two numerical methods for optimizing matrix stability
Cited in
(19)- Modified gradient sampling algorithm for nonsmooth semi-infinite programming
- A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity
- A BFGS-SQP method for nonsmooth, nonconvex, constrained optimization and its evaluation using relative minimization profiles
- A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming
- A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization
- A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information
- An SQP method for minimization of locally Lipschitz functions with nonlinear constraints
- A feasible point method with bundle modification for nonsmooth convex constrained optimization
- A proximal bundle method with exact penalty technique and bundle modification strategy for nonconvex nonsmooth constrained optimization
- A proximal-projection partial bundle method for convex constrained minimax problems
- An adaptive gradient sampling algorithm for non-smooth optimization
- Cost-effective robust stabilization and bifurcation suppression
- MultiSQP-GS: a sequential quadratic programming algorithm via gradient sampling for nonsmooth constrained multiobjective optimization
- Direct search nonsmooth constrained optimization via rounded ℓ1 penalty functions
- New proximal bundle algorithm based on the gradient sampling method for nonsmooth nonconvex optimization with exact and inexact information
- A Sequential Quadratic Programming Algorithm for Nonsmooth Problems with Upper- \({\boldsymbol{\mathcal{C}^2}}\) Objective
- A proximal bundle method-based algorithm with penalty strategy and inexact oracles for constrained nonsmooth nonconvex optimization
- A direct search quasi-Newton method for nonsmooth unconstrained optimization
- A new restricted memory level bundle method for constrained convex nonsmooth optimization
This page was built for publication: A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q393748)
