Cite Us

Previous topic



[Andreani2007]Andreani R, Birgin E, Martínez J, Schuverdt M (2007) On Augmented Lagrangian methods with general lower-level constraints. SIAM Journal on Optimization 18:1286-1309.
[Dai2008]Dai Y-h, and Schittkowski K (2008) A sequential quadratic programming algorithm with non-monotone line search, Pacific Journal of Optimization, 4:335-351.
[Deb2002]Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. Evolutionary Computation, IEEE Transactions on 6(2):181–197.
[Frick1989]Frick, JD, (1989) Variable-Metric Algorithm For Constrained Optimization. NASA Tech Briefs (ISSN 0145-319X) 13(9):78.
[Geem2001]Geem ZW, Kim JH, Loganathan GV (2001) A new heuristic optimization algorithm: Harmony search. Simulation 76:60–68.
[Gill2002]Gill PE, Murray W, Saunders MA (2002) SNOPT: An SQP algorithm for large-scale constrained optimization. SIAM Journal on Optimization 12:979–1006.
[Jansen2011]Jansen P, and Perez R (2011) Constrained Structural Design Optimization via a Parallel Augmented Lagrangian Particle Swarm Optimization Approach, International Journal of Computer and Structures, 89(13-14):1352–1366.
[Kraft1988]Kraft D (1988) A software package for sequential quadratic programming. Tech. Rep. DFVLR-FB 88-28, DLR German Aerospace Center — Institute for Flight Mechanics, Koln, Germany.
[Kuntsevich1997]Kuntsevich A, Kappel F (1997) SolvOpt manual: The solver for local nonlinear optimization problems. Tech. rep., Institute for Mathematics, Karl{Franzens University of Graz, Graz, Autria.
[Langtangen2008]Langtangen HP (2008) Python Scripting for Computational Science, Texts in Computational Science and Engineering, vol 3, 3rd edn. Springer.
[Lawrence1996]Lawrence CT, Tits AL (1996) Nonlinear equality constraints in feasible sequential quadratic programming. Optimization Methods and Software 6:265–282.
[Liuzzi2010]Liuzzi G, Lucidi S, Sciandrone M (2010) Sequential Penalty Derivative-free Methods for Nonlinear Constrained Optimization. SIAM Journal on Optimization 20(5):2614-2635.
[Perez2011]Perez R.E., Jansen P.W., and Martins J.R.R.A. (2011) pyOpt: A Python-Based Object-Oriented Framework for Nonlinear Constrained Optimization, Structures and Multidisciplinary Optimization, 45(1):101-118.
[Powell1994]Powell MJD (1994) Advances in Optimization and Numerical Analysis, Kluwer Academic, Dordrecht, A direct search optimization method that models the objective and constraint functions by linear interpolation, pp 51–67.
[Schitt1986]Schittkowski K (1986) NLPQL: A Fortran subroutine for solving constrained nonlinear programming problems. Annals of Operations Research 5(2):485–500.
[Schitt2011]Schittkowski k (2011) A robust implementation of a sequential quadratic programming algorithm with successive error restoration. Optimization Letters, 5(2):283-296. ‘<>`_
[Schluter2009]Schluter M, Egea J, Banga J (2009) Extended ant colony optimization for non-convex mixed integer nonlinear programming. Computers and Operations Research 36(7):2217–2229.
[Svanberg1987]Svanberg K (1987) The method of moving asymptotes — A new method for structural optimization. International Journal for Numerical Methods in Engineering 24(2):359–373.
[Svanberg1995]Svanberg K (1995) A globally convergent version of MMA without linesearch. In: First World Congress of Structural and Multidisciplinary Optimization, Goslar, Germany.
[Vanderplaats1973]Vanderplaats GN (1973) CONMIN — A Fortran program for constrained function minimization. Technical Memorandum TM X-62282, NASA Ames Research Center, Moffett Field, California.
[Vanderplaats1983]Vanderplaats GN (1983) A robust Feasible Directions algorithm for design synthesis. AIAA PAPER 83-0938, 24th Structures, Structural Dynamics and Materials Conference, Lake Tahoe, NV.
[Wrenn1989]Wrenn G (1989) An indirect method for numerical optimization using the Kreisselmeier–Steinhauser function. Contractor Report NASA CR-4220, NASA Langley Research Center, Hampton, VA.