A sequential quadratic programming algorithm for nonconvex, nonsmooth constrained optimization
From MaRDI portal
line search algorithmnonconvex and nonsmooth optimization problemssequential quadratic programming (SQP) algorithm
Numerical methods based on nonlinear programming (49M37) Numerical mathematical programming methods (65K05) Numerical optimization and variational techniques (65K10) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Methods of successive quadratic programming type (90C55)
Recommendations
- An efficient sequential quadratic programming algorithm for nonlinear programming
- A sequential quadratic programming algorithm for nonlinear minimax problems
- A Sequential Quadratic Programming Algorithm for Nonsmooth Problems with Upper- \({\boldsymbol{\mathcal{C}^2}}\) Objective
- scientific article; zbMATH DE number 3878695
- scientific article; zbMATH DE number 1919459
- An inexact sequential quadratic optimization algorithm for nonlinear optimization
- A successive quadratic programming method for a class of constrained nonsmooth optimization problems
- Sequential quadratic programming methods for parametric nonlinear optimization
- Sequential quadratic programming for large-scale nonlinear optimization
- An extended sequential quadratically constrained quadratic programming algorithm for nonlinear, semidefinite, and second-order cone programming
Cited in
(59)- Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions
- 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 fast gradient and function sampling method for finite-max functions
- A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization
- A new method based on the proximal bundle idea and gradient sampling technique for minimizing nonsmooth convex functions
- An approach for robust PDE-constrained optimization with application to shape optimization of electrical engines and of dynamic elastic structures under uncertainty
- A proximal bundle method-based algorithm with penalty strategy and inexact oracles for constrained nonsmooth nonconvex optimization
- A conjugate gradient sampling method for nonsmooth optimization
- Smoothing projected Barzilai-Borwein method for constrained non-Lipschitz optimization
- A hybrid method combining genetic algorithm and Hooke-Jeeves method for constrained global optimization
- On the convergence analysis of a penalty algorithm for nonsmooth optimization and its performance for solving hard-sphere problems
- An adaptive gradient sampling algorithm for non-smooth optimization
- A noniterative algorithm for the linear-quadratic profit-maximization model for smoothing multiproduct production
- scientific article; zbMATH DE number 5831961 (Why is no real title available?)
- A Sequential Quadratic Programming Method Without A Penalty Function or a Filter for Nonlinear Equality Constrained Optimization
- scientific article; zbMATH DE number 5987581 (Why is no real title available?)
- Block coordinate proximal gradient methods with variable Bregman functions for nonsmooth separable optimization
- A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization
- scientific article; zbMATH DE number 1053660 (Why is no real title available?)
- A sequential quadratic penalty method for nonlinear semidefinite programming
- Manifold sampling for optimization of nonconvex functions that are piecewise linear compositions of smooth components
- Linear models for the impact of order flow on prices. II: The mixture transition distribution model
- An SQP method for minimization of locally Lipschitz functions with nonlinear constraints
- A limited-memory quasi-Newton algorithm for bound-constrained non-smooth optimization
- A Sequential Minimization Technique for Elliptic Quasi-variational Inequalities with Gradient Constraints
- Smoothing augmented Lagrangian method for nonsmooth constrained optimization problems
- Exact guarantees on the absence of spurious local minima for non-negative rank-1 robust principal component analysis
- Direct search nonsmooth constrained optimization via rounded ℓ1 penalty functions
- A quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functions
- A new sequential optimality condition for constrained nonsmooth optimization
- Solving chance-constrained problems via a smooth sample-based nonlinear approximation
- Manifold sampling for optimizing nonsmooth nonconvex compositions
- Cost-effective robust stabilization and bifurcation suppression
- An adaptive competitive penalty method for nonsmooth constrained optimization
- A BFGS-SQP method for nonsmooth, nonconvex, constrained optimization and its evaluation using relative minimization profiles
- An active set sequential quadratic programming algorithm for nonlinear optimisation
- Smoothing SQP Methods for Solving Degenerate Nonsmooth Constrained Optimization Problems with Applications to Bilevel Programs
- Reduced subgradient bundle method for linearly constrained non-smooth non-convex problems
- A proximal bundle method with exact penalty technique and bundle modification strategy for nonconvex nonsmooth constrained optimization
- SOBMOR: Structured Optimization-Based Model Order Reduction
- An Improved Unconstrained Approach for Bilevel Optimization
- A Sequential Quadratic Programming Algorithm for Nonsmooth Problems with Upper- \({\boldsymbol{\mathcal{C}^2}}\) Objective
- New proximal bundle algorithm based on the gradient sampling method for nonsmooth nonconvex optimization with exact and inexact information
- A symmetric splitting sequential quadratic optimization algorithm for two-block nonlinearly constrained nonconvex optimization
- Fast optimization of viscosities for frequency‐weighted damping of second‐order systems
- Modified gradient sampling algorithm for nonsmooth semi-infinite programming
- Game-theoretic multi-agent motion planning in a mixed environment
- MultiSQP-GS: a sequential quadratic programming algorithm via gradient sampling for nonsmooth constrained multiobjective optimization
- Haar wavelet-based Galerkin method with its feasibility, consistency, and application to unmanned vehicle navigation around moving obstacles
- A bundle trust-region algorithm for nonsmooth nonconvex constrained optimization
- A subspace framework for \(\mathcal{L}_{\infty}\) model reduction
- Integration of adaptive projection BFGS and inertial extrapolation step for nonconvex optimization problems and its application in machine learning
- First-order methods for nonsmooth nonconvex functional constrained optimization with or without Slater points
- Goldstein stationarity in Lipschitz constrained optimization
- An effective subgradient algorithm via Mifflin's line search for nonsmooth nonconvex multiobjective optimization
- A descent subgradient method using Mifflin's line search for nonsmooth nonconvex optimization
- A gradient sampling method based on ideal direction for solving nonsmooth optimization problems
- A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees
This page was built for publication: A sequential quadratic programming 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 Q2910881)
