Minimizing and Stationary Sequences of Constrained Optimization Problems
DOI10.1137/S0363012995292548zbMATH Open0909.90235OpenAlexW2066160765MaRDI QIDQ4210193FDOQ4210193
Authors: Chin Cheng Chou, Jong-Shi Pang, K. F. Ng 
Publication date: 21 September 1998
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0363012995292548
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
error boundsconvex analysisminimizing sequencesstationary sequencesweak sharp minimaconvergence of algorithmsquadratic splinesapproximate optimality conditionswell-posed optimization problemsresidual functions
Convex programming (90C25) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cited In (17)
- Title not available (Why is that?)
- Pareto optimizing and scalarly stationary sequences
- Asymptotical well behaviour for constrained minimisation problems
- D-gap functions for nonsmooth variational inequality problems
- On minimizing sequences for an integral process with phase constraint
- Asymptotical good behavior on inequalities with completely approximate K-T concept
- Error bounds in mathematical programming
- On minimizing and stationary sequences of a new class of merit functions for nonlinear complementarity problems
- Convergence of a projected gradient method variant for quasiconvex objectives
- Two parallel distribution algorithms for convex constrained minimization problems
- Optimizing over Consecutive 1's and Circular 1's Constraints
- Title not available (Why is that?)
- Pareto Optimizing and Kuhn–Tucker Stationary Sequences
- Robust least square semidefinite programming with applications
- On the fulfillment of the complementary approximate Karush-Kuhn-Tucker conditions and algorithmic applications
- Minimizing and stationary sequences of convex constrained minimization problems
- Approximate efficiency and scalar stationarity in unbounded nonsmooth convex vector optimization problems
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)
