Pages that link to "Item:Q1148785"
From MaRDI portal
The following pages link to Test examples for nonlinear programming codes (Q1148785):
Displaying 39 items.
- Infeasible Mehrotra-type predictor–corrector algorithm for cartesian <i>P</i><sub>*</sub>(κ) nonlinear complementarity problems over symmetric cones (Q5031768) (← links)
- A derivative-free affine scaling trust region methods based on probabilistic models with new nonmonotone line search technique for linear inequality constrained minimization without strict complementarity (Q5031804) (← links)
- Direct search nonsmooth constrained optimization via rounded ℓ<sub>1</sub> penalty functions (Q5038179) (← links)
- Simultaneous iterative solutions for the trust-region and minimum eigenvalue subproblem (Q5038438) (← links)
- A primal–dual penalty method via rounded weighted-ℓ<sub>1</sub> Lagrangian duality (Q5054741) (← links)
- A globally convergent regularized interior point method for constrained optimization (Q5058383) (← links)
- A method combining norm-relaxed QCQP subproblems with active set identification for inequality constrained optimization (Q5085233) (← links)
- A derivative-free algorithm for non-linear optimization with linear equality constraints (Q5110328) (← links)
- Rapid infeasibility detection in a mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization (Q5198049) (← links)
- Nonmonotone conic trust region method with line search technique for bound constrained optimization (Q5242265) (← links)
- A Collection of Test Multiextremal Optimal Control Problems (Q5244697) (← links)
- A pattern search and implicit filtering algorithm for solving linearly constrained minimization problems with noisy objective functions (Q5379464) (← links)
- Condition for global convergence of a homotopy method for variational inequality problems on unbounded sets (Q5436922) (← links)
- Practical implementation of an interior point nonmonotone line search filter method (Q5459727) (← links)
- A gradient-only line search method for the conjugate gradient method applied to constrained optimization problems with severe noise in the objective function (Q5711744) (← links)
- Constructing test functions for global optimization using continuous formulations of graph problems (Q5717533) (← links)
- An interior global method for nonlinear systems with simple bounds (Q5717534) (← links)
- A globally convergent trust region multidimensional filter SQP algorithm for nonlinear programming (Q5850766) (← links)
- COCO: a platform for comparing continuous optimizers in a black-box setting (Q5859012) (← links)
- A novel augmented Lagrangian method of multipliers for optimization with general inequality constraints (Q5879119) (← links)
- Global optimization for mixed categorical-continuous variables based on Gaussian process models with a randomized categorical space exploration step (Q5882394) (← links)
- An ellipsoid algorithm for equality-constrained nonlinear programs (Q5926611) (← links)
- A superlinearly convergent method of feasible directions. (Q5931665) (← links)
- A family of improved secant methods via nonmonotone curvilinear paths technique for equality constrained optimization (Q5948567) (← links)
- A potential reduction algorithm for linearly constrained convex programming (Q5953365) (← links)
- Hybrid Newton-type method for a class of semismooth equations (Q5959915) (← links)
- A novel data-driven visualization of \(n\)-dimensional feasible region using interpretable self-organizing maps (iSOM) (Q6077657) (← links)
- Local search enhanced aquila optimization algorithm ameliorated with an ensemble of wavelet mutation strategies for complex optimization problems (Q6102647) (← links)
- Conditional gradient and bisection algorithms for non-convex optimization problem with random perturbation (Q6106813) (← links)
- A merit function approach for evolution strategies (Q6114898) (← links)
- Newton-type methods for constrained optimization with nonregular constraints (Q6122341) (← links)
- Derivative-free mixed binary necklace optimization for cyclic-symmetry optimal design problems (Q6159484) (← links)
- Dislocation hyperbolic augmented Lagrangian algorithm for nonconvex optimization (Q6181243) (← links)
- A projected-search interior-point method for nonlinearly constrained optimization (Q6498408) (← links)
- Duality in convex optimization for the hyperbolic augmented Lagrangian (Q6500232) (← links)
- A genetic algorithm for solving nonlinear optimization problem with max-Archimedean bipolar fuzzy relation equations (Q6536000) (← links)
- Adaptive multi-surrogate-based constrained optimization method and its application (Q6554058) (← links)
- Sample average approximation for stochastic programming with equality constraints (Q6622760) (← links)
- Nonmonotone alternative direction method based on simple conic model for unconstrained optimization (Q6635987) (← links)
