Convergence of sequential approximation method for constrained optimization problems
From MaRDI portal
Existence of optimal solutions belonging to restricted classes (Lipschitz controls, bang-bang controls, etc.) (49J30) Methods involving semicontinuity and convergence; relaxation (49J45) Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59)
Recommendations
- scientific article; zbMATH DE number 4193471
- scientific article; zbMATH DE number 1399483
- Convergence of a class of penalty methods for constrained scalar set-valued optimization
- Convergence of SQP-Like Methods for Constrained Optimization
- Convergence of diagonally stationary sequences in convex optimization
Cited in
(9)- Convergence of diagonally stationary sequences in convex optimization
- A convergence of ODE method in constrained optimization
- scientific article; zbMATH DE number 5824228 (Why is no real title available?)
- On the Convergence of a Sequential Penalty Function Method for Constrained Minimization
- Approximate solutions to H2 / H problems via sequences of H2-cost/ H2-constraint optimization problems
- Sequential greedy approximation for certain convex optimization problems
- scientific article; zbMATH DE number 834483 (Why is no real title available?)
- scientific article; zbMATH DE number 4193471 (Why is no real title available?)
- Convergence of Successive Approximation Methods with Parameter Target Sets
This page was built for publication: Convergence of sequential approximation method for constrained optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3180345)
