Convergent stepsizes for constrained optimization algorithms
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3852805 (Why is no real title available?)
- scientific article; zbMATH DE number 3709948 (Why is no real title available?)
- scientific article; zbMATH DE number 3727523 (Why is no real title available?)
- scientific article; zbMATH DE number 3281211 (Why is no real title available?)
- scientific article; zbMATH DE number 3309656 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- A feasible direction algorithm for convex optimization: Global convergence rates
- A general saddle point result for constrained optimization
- A globally convergent method for nonlinear programming
- A globally convergent, implementable multiplier method with automatic penalty limitation
- A robust secant method for optimization problems with inequality constraints
- A surperlinearly convergent algorithm for constrained optimization problems
- Convex programming in Hilbert space
- Diagonalized multiplier methods and quasi-Newton methods for constrained optimization
- Global and Asymptotic Convergence Rate Estimates for a Class of Projected Gradient Processes
- Minimization of functions having Lipschitz continuous first partial derivatives
- Newton’s Method and the Goldstein Step-Length Rule for Constrained Minimization Problems
- Nonlinear programming via an exact penalty function: Asymptotic analysis
- On the Local Convergence of Quasi-Newton Methods for Constrained Optimization
- Projected Newton Methods for Optimization Problems with Simple Constraints
- Projection methods in constrained optimisation and applications to optimal policy decisions
- Quasi-Newton Methods, Motivation and Theory
- Rates of Convergence for Conditional Gradient Algorithms Near Singular and Nonsingular Extremals
- Reduced quasi-Newton methods with feasibility improvement for nonlinearly constrained optimization
- Some examples of cycling in variable metric methods for constrained minimization
- Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problems
- Superlinearly convergent variable metric algorithms for general nonlinear programming problems
Cited in
(10)- An interior-point algorithm for nonlinear minimax problems
- scientific article; zbMATH DE number 4027183 (Why is no real title available?)
- Convergence properties and step size estimation for MLMS algorithm
- Equality and inequality constrained optimization algorithms with convergent stepsizes
- Globally convergent interior-point algorithm for nonlinear programming
- scientific article; zbMATH DE number 665581 (Why is no real title available?)
- Switching stepsize strategies for sequential quadratic programming
- Respecifying the weighting matrix of a quadratic objective function
- A constrained min-max algorithm for rival models of the same economic system
- scientific article; zbMATH DE number 786546 (Why is no real title available?)
This page was built for publication: Convergent stepsizes for constrained optimization algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1061005)
