An augmented Lagrangian-based method using primitive directions for mixed-integer nonlinear problems
From MaRDI portal
Cites work
- A branch-and-cut method for 0-1 mixed convex programming
- A Linesearch-Based Derivative-Free Approach for Nonsmooth Constrained Optimization
- A partition-based global optimization algorithm
- A projected-search interior-point method for nonlinearly constrained optimization
- A tree-search algorithm for mixed integer programming problems
- A two-stage active-set algorithm for bound-constrained optimization
- An active set feasible method for large-scale minimization problems with bound constraints
- An algorithmic framework based on primitive directions and nonmonotone line searches for black-box optimization problems with integer variables
- An augmented Lagrangian method exploiting an active-set strategy and second-order information
- An economic method of computing LPτ-sequences
- Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
- Bayesian optimization
- Benchmarking Derivative-Free Optimization Algorithms
- Benchmarking optimization software with performance profiles.
- Block coordinate descent for smooth nonconvex constrained minimization
- Branch and Bound Experiments in Convex Nonlinear Integer Programming
- Derivative-free methods for mixed-integer constrained optimization problems
- Generalized Benders decomposition
- Generating convex polynomial inequalities for mixed 0-1 programs
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- Implicit filtering
- MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
- Mixed-integer nonlinear optimization
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods
- On the paper ``Augmented Lagrangian algorithms for solving the continuous nonlinear resource allocation problem
- On the relation between constant positive linear dependence condition and quasinormality constraint qualification
- OrthoMADS: A Deterministic MADS Instance with Orthogonal Directions
- Practical augmented Lagrangian methods for constrained optimization
- Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
- Remark on algorithm 659
- Solving mixed integer nonlinear programs by outer approximation
This page was built for publication: An augmented Lagrangian-based method using primitive directions for mixed-integer nonlinear problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7234519)
