Minimizing and Stationary Sequences of Constrained Optimization Problems
From MaRDI portal
Recommendations
- Asymptotical well behaviour for constrained minimisation problems
- A new sequential optimality condition for constrained optimization and algorithmic consequences
- Pareto Optimizing and Kuhn–Tucker Stationary Sequences
- Convergence to second-order stationary points in inequality constrained optimization
- Two error bounds for constrained optimization problems and their applications
Cited in
(17)- On minimizing sequences for an integral process with phase constraint
- Pareto optimizing and scalarly stationary sequences
- Error bounds in mathematical programming
- Approximate efficiency and scalar stationarity in unbounded nonsmooth convex vector optimization problems
- On minimizing and stationary sequences of a new class of merit functions for nonlinear complementarity problems
- D-gap functions for nonsmooth variational inequality problems
- Optimizing over Consecutive 1's and Circular 1's Constraints
- Pareto Optimizing and Kuhn–Tucker Stationary Sequences
- scientific article; zbMATH DE number 1195574 (Why is no real title available?)
- Asymptotical good behavior on inequalities with completely approximate K-T concept
- scientific article; zbMATH DE number 1531729 (Why is no real title available?)
- Robust least square semidefinite programming with applications
- Asymptotical well behaviour for constrained minimisation problems
- Minimizing and stationary sequences of convex constrained minimization problems
- On the fulfillment of the complementary approximate Karush-Kuhn-Tucker conditions and algorithmic applications
- Two parallel distribution algorithms for convex constrained minimization problems
- Convergence of a projected gradient method variant for quasiconvex objectives
This page was built for publication: Minimizing and Stationary Sequences of Constrained Optimization Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4210193)
