A globally convergent method for nonlinear programming
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3476911 (Why is no real title available?)
- scientific article; zbMATH DE number 3323651 (Why is no real title available?)
- Dual Variable Metric Algorithms for Constrained Optimization
- Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms
- Stability of the solution of definite quadratic programs
- Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problems
- Superlinearly convergent variable metric algorithms for general nonlinear programming problems
Cited in
(only showing first 100 items - show all)- Identification of multibody vehicle models for crash analysis using an optimization methodology
- Sediment minimization in canals: an optimal control approach
- A hybrid inverse problem in the fluorescence ultrasound modulated optical tomography in the diffusive regime
- The Sequential Quadratic Programming Method
- The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. I. Convergence analysis
- On the local convergence of a penalty-function-free SQP method
- Nonparametric specification tests for conditional duration models
- A new successive quadratic programming algorithm
- Nonmonotone line search algorithm for constrained minimax problems
- Mise à jour de la métrique dans les méthodes de quasi-Newton réduites en optimisation avec contraintes d'égalité
- A first order, exact penalty function algorithm for equality constrained optimization problems
- A sparse sequential quadratic programming algorithm
- Separation process optimization calculations
- Matrix criterion robust linear quadratic control problem
- Sequential quadratic programming with a flexible step acceptance strategy
- A modified SQP algorithm for minimax problems
- Second order methods for solving extremum problems form optimal linar regression design
- A quadratic approximation method for minimizing a class of quasidifferentiable functions
- Exponentially convergent non overlapping domain decomposition methods for the Helmholtz equation
- A robust sequential quadratic programming method
- A trust region SQP-filter method for nonlinear second-order cone programming
- Optimal thrust allocation logic design of dynamic positioning with pseudo-inverse method
- Vertical slot fishways: Mathematical modeling and optimal management
- The kidney model as an inverse problem
- Improved filter-SQP algorithm with active set for constrained minimax problems
- Spatiotemporal vaccine allocation policies for epidemics with behavioral feedback dynamics
- Successive linearization methods for large-scale nonlinear programming problems
- A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity
- A recursive quadratic programming algorithm for semi-infinite optimization problems
- A global convergence theory for an active-trust-region algorithm for solving the general nonlinear programing problem.
- Optimal control of urban air pollution related to traffic flow in road networks
- Numerical comparisons of nonlinear programming algorithms on serial and vector processors using automatic differentiation
- A multiparametric strategy for the two step optimization of structural assemblies
- Global convergence of an SQP method without boundedness assumptions on any of the iterative sequences
- A hybrid differential dynamic programming algorithm for constrained optimal control problems. I: Theory
- A penalty-function-free line search SQP method for nonlinear programming
- A generalized gradient projection method for optimization problems with equality and inequality constraints about arbitrary initial point
- Equality and inequality constrained optimization algorithms with convergent stepsizes
- Fuzzy multi-objective programming for supplier selection and risk modeling: a possibility approach
- A superlinear convergence feasible sequential quadratic programming algorithm for bipedal dynamic walking robot via discrete mechanics and optimal control
- A trust region method with a conic model for nonlinearly constrained optimization
- Exact penalty functions and stability in locally Lipschitz programming
- Finite penalty methods with a linear approximation of the constraints. I
- An SQP method for minimization of locally Lipschitz functions with nonlinear constraints
- Expanded spatial four-link motion and path generation with order and branch defect elimination
- Experimental complexity analysis of continuous constraint satisfaction problems.
- Second-order conditions for an exact penalty function
- An \(RQP\) algorithm using a differentiable exact penalty function for inequality constrained problems
- A quasi-Newton method for estimating the parameter in a nonlinear hyperbolic system
- Probabilistic model identification of uncertainties in computational models for dynamical systems and experimental validation
- Nonlinear programming via an exact penalty function: Asymptotic analysis
- A primal-dual augmented Lagrangian
- A strongly convergent norm-relaxed method of strongly sub-feasible direction for optimization with nonlinear equality and inequality constraints
- A modified Newton method for constrained estimation in covariance structure analysis
- A globally convergent algorithm for nonlinearly constrained optimization problems
- A globalization scheme for the generalized Gauss-Newton method
- A combined principal component analysis and energy minimization-based approach to model deformation of web core beams
- Analytical modeling of laminated composite plates using Kirchhoff circuit and wave digital filters
- A successive quadratic programming algorithm with global and superlinear convergence properties
- Eine global and lokal überlineare knovergente regularisierung des wilson-vergahrens
- Finite-difference gradients versus error-quadrature gradients in the solution of parameterized optimal control problems
- Direct multiple shooting and generalized Gauss-Newton method for parameter estimation problems in ODE models
- Approximate prediction-based control method for nonlinear oscillatory systems with applications to chaotic systems
- -generalized statistics in personal income distribution
- Symmetric quadrature rules for tetrahedra based on a cubic close-packed lattice arrangement
- A projected lagrangian algorithm for semi-infinite programming
- A quasi-newton method for minimum trace factor analysis
- On solving three classes of nonlinear programming problems via simple differentiable penalty functions
- The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. II. An efficient implementation with linear least squares subproblems
- Exact barrier function methods for Lipschitz programs
- On minimax eigenvalue problems via constrained optimization
- A globally convergent constrained quasi-Newton method with an augmented lagrangian type penalty function
- Sequential penalty algorithm for nonlinear constrained optimization
- An exact penalty method for nonconvex problems covering, in particular, nonlinear programming, semidefinite programming, and second-order cone programming
- Actuator selection and placement for localized feedback flow control
- A dual differentiable exact penalty function
- On the local and global convergence of a reduced Quasi-Newton method1
- Solving nonlinear programming problems with very many constraints
- Maintaining the positive definiteness of the matrices in reduced secant methods for equality constrained optimization
- On a class fo hybrid methods for smooth constrained optimization
- Two-timescale recurrent neural networks for distributed minimax optimization
- Two nonlinear optimization methods for black box identification compared
- An active set RQP algorithm for engineering design optimization
- A new feasible descent algorithm combining SQP with generalized projection for optimization problems without strict complementarity
- A collaborative neurodynamic approach with two-timescale projection neural networks designed via majorization-minimization for global optimization and distributed global optimization
- Enlarging the region of convergence of Newton's method for constrained optimization
- On combining feasibility, descent and superlinear convergence in inequality constrained optimization
- Recourse-based stochastic nonlinear programming: properties and Benders-SQP algorithms
- Orthogonal and conjugate basis methods for solving equality constrained minimization problems
- Superlinearly convergent variable metric algorithms for general nonlinear programming problems
- Geared five-bar path generation with structural constraints
- Mathematical and metaheuristic applications in design optimization of steel frame structures: an extensive review
- GSGPEs: a MATLAB code for computing the ground state of systems of Gross-Pitaevskii equations
- A linear programming-based optimization algorithm for solving nonlinear programming problems
- A simple approximated solution method for solving fractional trust region subproblems of nonlinearly equality constrained optimization
- An algorithm for solving linearly constrained minimax problems
- Variable metric methods for minimizing a class of nondifferentiable functions
- Minimizing the sum of a linear and a linear fractional function applying conic quadratic representation: continuous and discrete problems
- Computational methods for optimum design of large complex systems
- A modified SQP method with nonmonotone technique and its global convergence
This page was built for publication: A globally convergent method for nonlinear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1229804)
