A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization
From MaRDI portal
Publication:393748
DOI10.1007/s11075-012-9692-5zbMath1285.65036OpenAlexW2043284395MaRDI QIDQ393748
Jian-Ling Li, Shuai Liu, Jin-Bao Jian, Chun-Ming 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
global convergencenonsmooth optimizationconstrained optimizationsequential quadratic programmingnumerical experimentsnonconvex optimizationnonlinear programmingClarke subdifferentialfeasible algorithmgradient sampling
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Methods of successive quadratic programming type (90C55)
Related Items
Direct search nonsmooth constrained optimization via rounded ℓ1 penalty functions ⋮ A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming ⋮ New proximal bundle algorithm based on the gradient sampling method for nonsmooth nonconvex optimization with exact and inexact information ⋮ A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information ⋮ A DIRECT SEARCH QUASI-NEWTON METHOD FOR NONSMOOTH UNCONSTRAINED OPTIMIZATION ⋮ 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 new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization ⋮ A proximal-projection partial bundle method for convex constrained minimax problems ⋮ Cost-Effective Robust Stabilization and Bifurcation Suppression ⋮ A new restricted memory level bundle method for constrained convex nonsmooth optimization ⋮ A proximal bundle method-based algorithm with penalty strategy and inexact oracles for constrained nonsmooth nonconvex optimization ⋮ A Proximal Bundle Method with Exact Penalty Technique and Bundle Modification Strategy for Nonconvex Nonsmooth Constrained Optimization
Uses Software
Cites Work
- Unnamed Item
- A feasible directions method for nonsmooth convex optimization
- A line search exact penalty method using steering rules
- Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions
- Globally convergent cutting plane method for nonconvex nonsmooth minimization
- Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions
- Two numerical methods for optimizing matrix stability
- Methods of descent for nondifferentiable optimization
- 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
- A Computationally Efficient Feasible Sequential Quadratic Programming Algorithm
- An adaptive gradient sampling algorithm for non-smooth optimization
- A Sequential Quadratic Programming Algorithm for Nonconvex, Nonsmooth Constrained Optimization
- A Nonderivative Version of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
- Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
- A New Superlinearly Convergent Strongly Subfeasible Sequential Quadratic Programming Algorithm for Inequality-Constrained Optimization
- Optimization and nonsmooth analysis
- A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
- Exact penalty functions in nonlinear programming
- Optimization of lipschitz continuous functions
- Combined phase I—phase II methods of feasible directions
- An Algorithm for the Inequality-Constrained Discrete Min--Max Problem
- Pseudospectral Components and the Distance to Uncontrollability
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- An Infeasible Bundle Method for Nonsmooth Convex Constrained Optimization without a Penalty Function or a Filter
- A computational comparison of some non-linear programs
