Pages that link to "Item:Q5574524"
From MaRDI portal
The following pages link to The Slacked Unconstrained Minimization Technique for Convex Programming (Q5574524):
Displayed 14 items.
- Theoretical properties and numerical tests of an efficient nonlinear decomposition algorithm (Q755430) (← links)
- Optimization of electrical networks using nonlinear programming (Q1211035) (← links)
- Rates of convergence for a method of centers algorithm (Q1215256) (← links)
- Interior point penalty functions for constrained minimization (Q1215462) (← links)
- A generalization of Lagrange's method of undetermined multipliers using zero-zone functionals (Q1219830) (← links)
- Approximation methods for the unconstrained optimization (Q1234630) (← links)
- Nonlinear programming solutions for controlling the vibration pattern of stretched strings (Q1249974) (← links)
- A proof of the convergence of the Kelley-Bryson penalty function technique for state-constrained control problems (Q2531375) (← links)
- Penalty methods for mathematical programming in \(E^n\) with general constraint sets (Q2537022) (← links)
- Balance function for the optimal control problem (Q2542646) (← links)
- Some representation theorems for functions and sets and their application to nonlinear programming (Q2546330) (← links)
- On infinite-dimensional convex programs (Q2553312) (← links)
- An implementation of some implicit function theorems with applications to sensitivity analysis (Q4170538) (← links)
- A language for nonlinear programming problems (Q5653824) (← links)