Analysis and implementation of a dual algorithm for constrained optimization
From MaRDI portal
Recommendations
- Dual techniques for constrained optimization
- Dual active sets and constrained optimization
- A convergence analysis of a nonlinear Lagrange algorithm for general nonlinear constrained optimization problems
- A globally and quadratically convergent primal–dual augmented Lagrangian algorithm for equality constrained optimization
- A globally convergent algorithm for nonlinearly constrained optimization problems
Cites work
- scientific article; zbMATH DE number 3833218 (Why is no real title available?)
- scientific article; zbMATH DE number 3816913 (Why is no real title available?)
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- scientific article; zbMATH DE number 3976197 (Why is no real title available?)
- scientific article; zbMATH DE number 41472 (Why is no real title available?)
- scientific article; zbMATH DE number 3466802 (Why is no real title available?)
- scientific article; zbMATH DE number 3284927 (Why is no real title available?)
- scientific article; zbMATH DE number 3356498 (Why is no real title available?)
- scientific article; zbMATH DE number 3363343 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- scientific article; zbMATH DE number 3382096 (Why is no real title available?)
- A Gauss-Newton Approach to Solving Generalized Inequalities
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- A derivative-based bracketing scheme for univariate minimization and the conjugate gradient method
- A dual approach to solving nonlinear programming problems by unconstrained optimization
- A projected Lagrangian algorithm and its implementation for sparse nonlinear constraints
- A quadratically-convergent algorithm for general nonlinear programming problems
- A robust sequential quadratic programming method
- A sequential quadratic programming method for potentially infeasible mathematical programs
- Algorithmic equivalence in quadratic programming. I. A least-distance programming problem
- Application of the Armijo stepsize rule to the solution of a nonlinear system of equalities and inequalities
- Approximations to the Multiplier Method
- Diagonalized multiplier methods and quasi-Newton methods for constrained optimization
- Dual techniques for constrained optimization
- Extension of Newton's method to nonlinear functions with values in a cone
- Global convergence of Rosen's gradient projection method
- Large-scale linearly constrained optimization
- Methods for Computing and Modifying the LDV Factors of a Matrix
- Methods for Modifying Matrix Factorizations
- Minimization of functions having Lipschitz continuous first partial derivatives
- Multiplier and gradient methods
- Newton's method for nonlinear inequalities
- Newton's method for the solution of systems of equalities and inequalities
- Nonlinear programming via an exact penalty function: Asymptotic analysis
- Nonlinear programming via an exact penalty function: Global analysis
- On the global stabilization of locally convergent algorithms
- Strongly Regular Generalized Equations
- Test example for nonlinear programming codes
- The multiplier method of Hestenes and Powell applied to convex programming
- Updating the Inverse of a Matrix
- Variable Metric Method for Minimization
Cited in
(22)- New versions of Newton method: step-size choice, convergence domain and under-determined equations
- On R-linear convergence of semi-monotonic inexact augmented Lagrangians for saddle point problems
- Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization
- Computational study of the GDPO dual phase-1 algorithm
- Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming
- Projection onto a polyhedron that exploits sparsity
- Dual techniques for constrained optimization
- Algorithm 1035: a gradient-based implementation of the polyhedral active set algorithm
- scientific article; zbMATH DE number 4030685 (Why is no real title available?)
- On R-linear convergence of semi-monotonic inexact augmented Lagrangians for bound and equality constrained quadratic programming problems with application
- Handling infeasibility in a large-scale nonlinear optimization algorithm
- Dual active sets and constrained optimization
- An optimal algorithm for a class of equality constrained quadratic programming problems with bounded spectrum
- Sparse solutions of optimal control via Newton method for under-determined systems
- Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
- Numerical comparison of augmented Lagrangian algorithms for nonconvex problems
- An optimal algorithm for bound and equality constrained quadratic programming problems with bounded spectrum
- Optimal iterative QP and QPQC algorithms
- LMBOPT: a limited memory method for bound-constrained optimization
- Study of a primal-dual algorithm for equality constrained minimization
- On the use of optimization models for portfolio selection: A review and some computational results
- Semi-monotonic inexact augmented Lagrangians for quadratic programing with equality constraints
This page was built for publication: Analysis and implementation of a dual algorithm for constrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1321425)
