An Algorithm for Separable Nonconvex Programming Problems

Recommendations

A branch and bound algorithm for solving separable convex integer programming problems
On nonconvex optimization problems with separated nonconvex variables
scientific article; zbMATH DE number 2146951
An algorithmic framework for MINLP with separable non-convexity
scientific article; zbMATH DE number 713582

Cited in

(only showing first 100 items - show all)

On optimal zero-preserving corrections for inconsistent linear systems
A new simplicial cover technique in constrained global optimization
On nonconvex optimization problems with separated nonconvex variables
Subdomain separability in global optimization
A simplicial branch-and-bound algorithm conscious of special structures in concave minimization problems
Mean-variance portfolio optimal problem under concave transaction cost
A Lagrangian heuristic for concave cost facility location problems: the plant location and technology acquisition problem
Fractional programming with convex quadratic forms and functions
Robust network design in telecommunications under polytope demand uncertainty
An implicit enumeration method for global optimization problems
Decomposition based and branch and bound global optimization approaches for the phase equilibrium problem
Reverse propagation of McCormick relaxations
Lifted inequalities for \(0-1\) mixed-integer bilinear covering sets
Membership functions, some mathematical programming models and production scheduling
A branch and bound algorithm for solving a class of D-C programming
Extension of optimality conditions via supporting functions
scientific article; zbMATH DE number 713582 (Why is no real title available?)
Convex quadratic underestimation and Branch and Bound for univariate global optimization with one nonconvex constraint
A decomposition approach for global optimum search in QP, NLP and MINLP problems
Facets of a mixed-integer bilinear covering set with bounds on variables
On consistency of bounding operations in deterministic global optimization
Ordering policies of a deteriorating item in an EOQ model under upstream partial order-quantity-dependent trade credit and downstream full trade credit
On the convexification of nonlinear programming problems: An applications-oriented survey
Credal networks
On solving nonconvex optimization problems by reducing the duality gap
Computing subgradients of convex relaxations for solutions of parametric ordinary differential equations
Discretizing dynamic programs
Domain reduction techniques for global NLP and MINLP optimization
Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems
Deterministic global optimization of process flowsheets in a reduced space using McCormick relaxations
Algorithmic problems of nontransitive (SSB) utilities
Minimum concave-cost network flow problems: Applications, complexity, and algorithms
Proof of convergence for a global optimization algorithm for problems with ordinary differential equations
Stochastic allocation of inspection capacity to competitive processes
Decomposition of mathematical programming problems by dynamic programming and its application to block-diagonal geometric programms
Discrete solutions to engineering design problems
Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints
Reversed geometric programming: A branch-and-bound method involving linear subproblems
(Global) optimization: historical notes and recent developments
A method for globally minimizing concave functions over convex sets
On the indefinite quadratic bilevel programming problem.
Quasiconvex relaxations based on interval arithmetic
The polyadic structure of factorable function tensors with applications to high-order minimization techniques
Nonlinear separation of data via mixed 0-1 integer and linear programming
Power-to-chemicals: a superstructure problem for sustainable syngas production
An algorithmic framework for MINLP with separable non-convexity
Solving the staircase cost facility location problem with decomposition and piecewise linearization
An exact algorithm for the concave transportation problem
Bounding a class of nonconvex linearly-constrained resource allocation problems via the surrogate dual
Algorithms for parametric nonconvex programming
A parallel algorithm for partially separable non-convex global minimization: Linear constraints
Separable concave minimization via partial outer approximation and branch and bound
Global optimization of bounded factorable functions with discontinuities
An Exact Algorithm for Large-Scale Continuous Nonlinear Resource Allocation Problems with Minimax Regret Objectives
Convergent upper bounds in global minimization with nonlinear equality constraints
Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
Tabu search applied to the general fixed charge problem
New dual-type decomposition algorithm for non-convex separable optimization problems
Optimization-based convex relaxations for nonconvex parametric systems of ordinary differential equations
Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems
Reachability analysis and deterministic global optimization of DAE models
Dual toll pricing for hazardous materials transport with linear delay
An algorithm for optimizing network flow capacity under economies of scale
On the reduction of nonconvex problems of generalized semi-infinite mathematical programming to convex problems of semi-infinite programming
Deterministic global optimization of steam cycles using the IAPWS-IF97 model
An algorithm for nonconvex programming problems
An integer concave minimization approach for the minimum concave cost capacitated flow problem on networks
Solving a class of multiplicative programs with 0-1 knapsack constraints
Optimization of a long-short portfolio under nonconvex transaction cost
A general purpose exact solution method for mixed integer concave minimization problems
A comparative analysis of linear fitting for non-linear functions on optimization. A case study: Air pollution problems
scientific article; zbMATH DE number 1292040 (Why is no real title available?)
On the convergence of two branch-and-bound algorithms for nonconvex programming problems
Global search algorithms for minimum concave-cost network flow problems
Variations and extension of the convex-concave procedure
A fast memoryless interval-based algorithm for global optimization
Construction of the convex hulls of functions for the branch-and-bound method
Biconvex sets and optimization with biconvex functions: a survey and extensions
A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs
Global optimization versus integer programming in portfolio optimization under nonconvex transaction costs
scientific article; zbMATH DE number 4070220 (Why is no real title available?)
Subdivision of simplices relative to a cutting plane and finite concave minimization
An algorithm for indefinite integer quadratic programming
On some optimization problems under uncertainty
Extended reverse-convex programming: an approximate enumeration approach to global optimization
An all-linear programming relaxation algorithm for optimizing over the efficient set
Optimal deviations from an asset allocation.
Global optimization of nonconvex problems with multilinear intermediates
A convergent simplicial algorithm with -subdivision and -bisection strategies
A modified simplicial algorithm for convex maximization based on an extension of \(\omega \)-subdivision
Convex and concave relaxations of implicit functions
Global optimization using special ordered sets
Deletion-by-infeasibility rule for DC-constrained global optimization
An interval branch and bound algorithm for global optimization of a multiperiod pricing model
On the global minimization of concave functions
Global optimization algorithms for linearly constrained indefinite quadratic problems
On the nonlinear multilevel programming problems
Minimizing a sum of staircase functions under linear constraints
Two algorithms for maximizing a separable concave function over a polymatroid feasible region
Minimal ellipsoid circumscribing a polytope defined by a system of linear inequalities

This page was built for publication: An Algorithm for Separable Nonconvex Programming Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5558786)