Non-convex optimization problems with linear KKT subsystem
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1057696 (Why is no real title available?)
- scientific article; zbMATH DE number 757675 (Why is no real title available?)
- scientific article; zbMATH DE number 757677 (Why is no real title available?)
- scientific article; zbMATH DE number 3215121 (Why is no real title available?)
- scientific article; zbMATH DE number 5066287 (Why is no real title available?)
- A branch and bound algorithm for the global optimization of Hessian Lipschitz continuous functions
- A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems
- A branch-and-bound based method for solving monotone optimization problems
- A comparison of complete global optimization solvers
- A convergent conical algorithm with -bisection for concave minimization
- A finite algorithm for concave minimization over a polyhedron
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
- A global minimization algorithm for Lipschitz functions
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- A new accelerating method for globally solving a class of nonconvex programming problems
- A new approach to optimization under monotonic constraint
- A polyhedral branch-and-cut approach to global optimization
- A reformulation-convexification approach for solving nonconvex quadratic programming problems
- A relaxation algorithm for the minimization of a quasiconcave function on a convex polyhedron
- A relaxation method for nonconvex quadratically constrained quadratic programs
- A review of recent advances in global optimization
- A semidefinite framework for trust region subproblems with applications to large scale minimization
- A simple parallel algorithm with an \(O(1/t)\) convergence rate for general convex programs
- A survey of hidden convex optimization
- An FPTAS for minimizing a class of low-rank quasi-concave functions over a convex set
- An alogrithm for monotonic global optimization problems∗
- Bound constrained interval global optimization in the COCONUT environment
- Bounds tightening based on optimality conditions for nonconvex box-constrained optimization
- Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties
- CVXPY: a Python-embedded modeling language for convex optimization
- Canonical duality theory and solutions to constrained nonconvex quadratic programming
- Canonical duality theory: connections between nonconvex mechanics and global optimization
- Computing Optimal Locally Constrained Steps
- Concave minimization over a convex polyhedron
- Concave programming in control theory
- Convergence and application of a decomposition method using duality bounds for nonconvex global optimization
- Convex analysis and global optimization
- Convex envelope of bivariate cubic functions over rectangular regions
- Convex programs with an additional reverse convex constraint
- DC programming and DCA: thirty years of developments
- DC programming: overview.
- Derivative-free optimization: a review of algorithms and comparison of software implementations
- Deterministic global optimization. An introduction to the diagonal approach
- Ellipsoidal approach to box-constrained quadratic problems
- Exact penalty and error bounds in DC programming
- Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs
- Exactness of semidefinite relaxations for nonlinear optimization problems with underlying graph structure
- Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations
- Faster, but weaker, relaxations for quadratically constrained quadratic programs
- Finitely convergent cutting planes for concave minimization
- Generalized S-lemma and strong duality in nonconvex quadratic programming
- Global minimization of difference of quadratic and convex functions over box or binary constraints
- Global minimum potential energy conformations of small molecules
- Global optimization for special reverse convex programming
- Globally solving nonconvex quadratic programming problems via completely positive programming
- Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods
- Handbook of combinatorial optimization. In 5 volumes
- Hidden conic quadratic representation of some nonconvex quadratic optimization problems
- Hidden convexity in some nonconvex quadratically constrained quadratic programming
- How to convexify the intersection of a second order cone and a nonconvex quadratic
- Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects
- Introduction to global optimization.
- Lagrange duality and partitioning techniques in nonconvex global optimization
- Lipschitzian optimization without the Lipschitz constant
- Methods for Global Concave Minimization: A Bibliographic Survey
- Methods for convex and general quadratic programming
- Monotonic Optimization: Branch and Cut Methods
- Monotonic optimization: Problems and solution approaches
- Newton’s Method with a Model Trust Region Modification
- On box constrained concave quadratic optimization
- On convex relaxations for quadratically constrained quadratic programming
- On copositive programming and standard quadratic optimization problems
- On duality bound methods for nonconvex global optimization
- On interval branch-and-bound for additively separable functions with common variables
- On nonconvex optimization problems with separated nonconvex variables
- On nonconvex quadratic programming with box constraints
- On solving a d.c. programming problem by a sequence of linear programs
- On the complexity of quadratic programming with two quadratic constraints
- On the tightness of SDP relaxations of QCQPs
- Optimality-based domain reduction for inequality-constrained NLP and MINLP problems
- Parametric simplex algorithms for solving a special class of nonconvex minimization problems
- Polynomial Solvability of Variants of the Trust-Region Subproblem
- Polynomial time algorithms for some classes of constrained nonconvex quadratic problems
- Quadratic programming with one negative eigenvalue is NP-hard
- Recent advances in trust region algorithms
- Representing quadratically constrained quadratic programs as generalized copositive programs
- Reverse convex programming
- Robust Solutions to Least-Squares Problems with Uncertain Data
- SOCP reformulation for the generalized trust region subproblem via a canonical form of two symmetric matrices
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- SnapVX: a network-based convex optimization solver
- Solutions and optimality criteria to box constrained nonconvex minimization problems
- Solutions to quadratic minimization problems with box and integer constraints
- Solving generalized CDT problems via two-parameter eigenvalues
- Solving the Fixed Charge Problem by Ranking the Extreme Points
- Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints
- The generalized trust region subproblem
- The generalized trust region subproblem: solution complexity and convex hull results
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
This page was built for publication: Non-convex optimization problems with linear KKT subsystem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6834650)
