Nonlinear programming without a penalty function.
From MaRDI portal
Publication:5957565
Recommendations
- Nonlinear programming without a penalty function or a filter
- A trust-region SQP method without a penalty or a filter for nonlinear programming
- A two step filter SQP algorithm for nonlinear constrained optimization
- Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming
- Sequential penalty quadratic programming filter methods for nonlinear programming
Cited in
(only showing first 100 items - show all)- GOSAC: global optimization with surrogate approximation of constraints
- Hierarchically constrained blackbox optimization
- An adaptively regularized sequential quadratic programming method for equality constrained optimization
- Global convergence of a general filter algorithm based on an efficiency condition of the step
- A filter proximal bundle method for nonsmooth nonconvex constrained optimization
- The DIRECT algorithm: 25 years later
- A filled function method dominated by filter for nonlinearly global optimization
- Global convergence of a nonmonotone filter method for equality constrained optimization
- An interior-point method for nonlinear optimization problems with locatable and separable nonsmoothness
- A globally and superlinearly convergent modified SQP-filter method
- On a globally convergent trust region algorithm with infeasibility control for equality constrained optimization
- A nonmonotone filter trust region method for nonlinear constrained optimization
- Improved versions of the LEDE algorithm for constrained global optimization
- Handling of constraints in multiobjective blackbox optimization
- Stochastic filter methods for generally constrained global optimization
- Global convergence of a tri-dimensional filter SQP algorithm based on the line search method
- On filter-successive linearization methods for nonlinear semidefinite programming
- AN INFEASIBLE SSLE FILTER ALGORITHM FOR GENERAL CONSTRAINED OPTIMIZATION WITHOUT STRICT COMPLEMENTARITY
- Nonmonotone filter DQMM method for the system of nonlinear equations
- UAV formation flight based on nonlinear model predictive control
- Combining discrete and continuous optimization to solve kinodynamic motion planning problems
- Use of a biobjective direct search algorithm in the process design of material science applications
- A secant algorithm with line search filter method for nonlinear optimization
- Algorithm 1035: a gradient-based implementation of the polyhedral active set algorithm
- An affine scaling interior trust-region method combining with nonmonotone line search filter technique for linear inequality constrained minimization
- A nonmonotone filter method for nonlinear optimization
- A filter algorithm for nonlinear systems of equalities and inequalities
- A filter-based artificial fish swarm algorithm for constrained global optimization: theoretical and practical issues
- A line search SQP method without a penalty or a filter
- A line search filter algorithm with inexact step computations for equality constrained optimization
- A derivative-free trust-funnel method for equality-constrained nonlinear optimization
- Optimality properties of an augmented Lagrangian method on infeasible problems
- A nonmonotone line search filter algorithm for the system of nonlinear equations
- Use of quadratic models with mesh-adaptive direct search for constrained black box optimization
- A null-space primal-dual interior-point algorithm for nonlinear optimization with nice convergence properties
- Nonconvex constrained optimization by a filtering branch and bound
- Handling infeasibility in a large-scale nonlinear optimization algorithm
- A primal-dual augmented Lagrangian penalty-interior-point filter line search algorithm
- A new nonmonotone filter Barzilai–Borwein method for solving unconstrained optimization problems
- Global convergence of a robust filter SQP algorithm
- A smoothing conic trust region filter method for the nonlinear complementarity problem
- An alternating structured trust region algorithm for separable optimization problems with nonconvex constraints
- A modified SQP-filter method and its global convergence
- Approximating a solution set of nonlinear inequalities
- Infimal convolution and duality in convex mathematical programming
- Escaping unknown discontinuous regions in blackbox optimization
- Derivative-free optimization and filter methods to solve nonlinear constrained problems
- A modified SLP algorithm and its global convergence
- A sequential quadratic programming with a dual parametrization approach to nonlinear semi-infinite programming
- Calibration of parameters in dynamic energy budget models using direct-search methods
- Global convergence of a new nonmonotone filter method for equality constrained optimization
- A new filter method for solving nonlinear complementarity problems
- The quasiparticle lifetime in a doped graphene sheet
- Optimal charging facility location and capacity for electric vehicles considering route choice and charging time equilibrium
- A filter sequential adaptive cubic regularization algorithm for nonlinear constrained optimization
- A recipe for finding good solutions to MINLPs
- A trust-region framework for constrained optimization using reduced order modeling
- A new sequential quadratic programming method without a penalty function or a filter
- A filter-line-search method for unconstrained optimization
- Optimal non-anticipative scenarios for nonlinear hydro-thermal power systems
- A modified SQP method with nonmonotone technique and its global convergence
- On the effectiveness of sequential linear programming for the pooling problem
- A trust-region method for nonlinear bilevel programming: algorithm and computational exper\-ience
- A Kalman-tracking filter approach to nonlinear programming
- A line search filter inexact reduced Hessian method for nonlinear equality constrained optimization
- Optimization-based approach to path planning for closed chain robot systems
- Global and local convergence of a new affine scaling trust region algorithm for linearly constrained optimization
- COAP 2012 Best Paper Prize
- A filter algorithm with inexact line search
- Extended duality in fuzzy optimization problems
- A penalty-free-type nonmonotone trust-region method for nonlinear constrained optimization
- A nonmonotone line search filter method with reduced Hessian updating for nonlinear optimization
- A feasible filter SQP algorithm with global and local convergence
- Inexact-restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming.
- A trust-region SQP method without a penalty or a filter for nonlinear programming
- A modified SQP-filter method for nonlinear complementarity problem
- TRESNEI, a MATLAB trust-region solver for systems of nonlinear equalities and inequalities
- The Price of Inexactness: Convergence Properties of Relaxation Methods for Mathematical Programs with Complementarity Constraints Revisited
- An overview of nonlinear optimization
- Assessing the potential of interior point barrier filter line search methods: nonmonotone versus monotone approach
- An improved filter method for nonlinear complementarity problem
- On convergence analysis of a derivative-free trust region algorithm for constrained optimization with separable structure
- A filter method for nonlinear semidefinite programming with global convergence
- Line search filter inexact secant methods for nonlinear equality constrained optimization
- Optimization of algorithms with OPAL
- Projected filter trust region methods for a semismooth least squares formulation of mixed complementarity problems
- A variable metric method for nonsmooth convex constrained optimization
- Guided dive for the spatial branch-and-bound
- Some results on the filter method for nonlinear complementary problems
- CONORBIT: constrained optimization by radial basis function interpolation in trust regions
- Interior point methods for large-scale nonlinear programming
- Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search
- Reverse bridge theorem under constraint partition
- A penalty-free method with line search for nonlinear equality constrained optimization
- Globalization strategies for mesh adaptive direct search
- Newton-type methods for constrained optimization with nonregular constraints
- A computational framework for derivative-free optimization of cardiovascular geometries
- Global and local convergence of a nonmonotone SQP method for constrained nonlinear optimization
- The Statistical Filter Approach to Constrained Optimization
- Bayesian Optimization via Exact Penalty
This page was built for publication: Nonlinear programming without a penalty function.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5957565)