A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization
From MaRDI portal
Publication:393748
DOI10.1007/S11075-012-9692-5zbMATH Open1285.65036OpenAlexW2043284395MaRDI QIDQ393748FDOQ393748
Authors: Shuai Liu, Jian-Ling Li, Jinbao Jian, Chunming Tang 
Publication date: 24 January 2014
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-012-9692-5
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
nonconvex optimizationnonlinear programmingsequential quadratic programmingconstrained optimizationglobal convergencenumerical experimentsnonsmooth optimizationClarke subdifferentialfeasible algorithmgradient sampling
Numerical mathematical programming methods (65K05) Methods of successive quadratic programming type (90C55) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)
Cites Work
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- Globally convergent cutting plane method for nonconvex nonsmooth minimization
- Methods of descent for nondifferentiable optimization
- Optimization and nonsmooth analysis
- Exact penalty functions in nonlinear programming
- An Infeasible Bundle Method for Nonsmooth Convex Constrained Optimization without a Penalty Function or a Filter
- A computationally efficient feasible sequential quadratic programming algorithm
- A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
- Optimization of lipschitz continuous functions
- Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
- A line search exact penalty method using steering rules
- Title not available (Why is that?)
- A sequential quadratic programming algorithm for nonconvex, nonsmooth constrained optimization
- Two numerical methods for optimizing matrix stability
- A nonderivative version of the gradient sampling algorithm for nonsmooth nonconvex optimization
- A feasible directions method for nonsmooth convex optimization
- Combined phase I—phase II methods of feasible directions
- Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions
- On combining feasibility, descent and superlinear convergence in inequality constrained optimization
- New sequential quadratically-constrained quadratic programming method of feasible directions and its convergence rate
- An adaptive gradient sampling algorithm for non-smooth optimization
- A New Superlinearly Convergent Strongly Subfeasible Sequential Quadratic Programming Algorithm for Inequality-Constrained Optimization
- An Algorithm for the Inequality-Constrained Discrete Min--Max Problem
- Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions
- Pseudospectral Components and the Distance to Uncontrollability
- A computational comparison of some non-linear programs
Cited In (19)
- Modified gradient sampling algorithm for nonsmooth semi-infinite programming
- 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 feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity
- A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization
- An SQP method for minimization of locally Lipschitz functions with nonlinear constraints
- A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information
- 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
Uses Software
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)
