Journal: Computational Optimization and Applications

Found 579 papers in total
Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems
Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems
2016,
Semi‐infinite problem (SIPs) are widely used in many control systems for...
Sufficient weighted complementarity problems
Sufficient weighted complementarity problems
2016,
This paper presents some fundamental results about sufficient linear weighted...
On how to solve large-scale log-determinant optimization problems
On how to solve large-scale log-determinant optimization problems
2016,
We propose a proximal augmented Lagrangian method and a hybrid method, i.e., employing...
Clustering-based preconditioning for stochastic programs
Clustering-based preconditioning for stochastic programs
2016,
We present a clustering‐based preconditioning strategy for KKT systems arising...
Variance reduction in Monte Carlo sampling-based optimality gap estimators for two-stage stochastic linear programming
Variance reduction in Monte Carlo sampling-based optimality gap estimators for two-stage stochastic linear programming
2016,
This paper presents a comparative computational study of the variance reduction...
Optimal averaged Hausdorff archives for bi-objective problems: theoretical and numerical results
Optimal averaged Hausdorff archives for bi-objective problems: theoretical and numerical results
2016,
One main task in evolutionary multiobjective optimization (EMO) is to obtain a...
Distortion compensation as a shape optimisation problem for a sharp interface model
Distortion compensation as a shape optimisation problem for a sharp interface model
2016,
A mechanical equilibrium problem for a material consisting of two components with...
A generalization of ω-subdivision ensuring convergence of the simplicial algorithm
A generalization of ω-subdivision ensuring convergence of the simplicial algorithm
2016,
In this paper, we refine the proof of convergence by Kuno–Buckland (J Global...
Theoretical and computational results about optimality-based domain reductions
Theoretical and computational results about optimality-based domain reductions
2016,
In this paper we discuss optimality‐based domain reductions for Global...
Bounding duality gap for separable problems with linear constraints
Bounding duality gap for separable problems with linear constraints
2016,
We consider the problem of minimizing a sum of non‐convex functions over a...
An inertia-free filter line-search algorithm for large-scale nonlinear programming
An inertia-free filter line-search algorithm for large-scale nonlinear programming
2016,
We present a filter line‐search algorithm that does not require inertia...
State-defect constraint pairing graph coarsening method for Karush‐Kuhn‐Tucker matrices arising in orthogonal collocation methods for optimal control
State-defect constraint pairing graph coarsening method for Karush‐Kuhn‐Tucker matrices arising in orthogonal collocation methods for optimal control
2016,
A state‐defect constraint pairing graph coarsening method is described for...
Column generation approaches for the software clustering problem
Column generation approaches for the software clustering problem
2016,
This work presents the application of branch‐and‐price approaches to the...
The split Bregman algorithm applied to PDE-constrained optimization problems with total variation regularization
The split Bregman algorithm applied to PDE-constrained optimization problems with total variation regularization
2016,
We derive an efficient solution method for ill‐posed PDE‐constrained...
Selective bi-coordinate variations for resource allocation type problems
Selective bi-coordinate variations for resource allocation type problems
2016,
We suggest a modification of the coordinate descent methods for resource allocation...
Computing the distance between the linear matrix pencil and the completely positive cone
Computing the distance between the linear matrix pencil and the completely positive cone
2016,
In this paper, we consider the problem of computing the distance between the linear...
A fast dual proximal-gradient method for separable convex optimization with linear coupled constraints
A fast dual proximal-gradient method for separable convex optimization with linear coupled constraints
2016,
In this paper we consider a class of separable convex optimization problems with...
Stochastic derivative-free optimization using a trust region framework
Stochastic derivative-free optimization using a trust region framework
2016,
This paper presents a trust region algorithm to minimize a function f when one has...
The R-linear convergence rate of an algorithm arising from the semi-smooth Newton method applied to 2D contact problems with friction
The R-linear convergence rate of an algorithm arising from the semi-smooth Newton method applied to 2D contact problems with friction
2015,
The goal is to analyze the semi‐smooth Newton method applied to the solution of...
Interval-based ranking in noisy evolutionary multi-objective optimization
Interval-based ranking in noisy evolutionary multi-objective optimization
2015,
As one of the most competitive approaches to multi‐objective optimization,...
Superconvergence for Neumann boundary control problems governed by semilinear elliptic equations
Superconvergence for Neumann boundary control problems governed by semilinear elliptic equations
2015,
This paper is concerned with the discretization error analysis of semilinear Neumann...
Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers
Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers
2015,
The vehicle routing problem with stochastic demands and customers (VRPSDC) requires...
A primal-dual interior point method for large-scale free material optimization
A primal-dual interior point method for large-scale free material optimization
2015,
Free Material Optimization (FMO) is a branch of structural optimization in which the...
Terminating evolutionary algorithms at their steady state
Terminating evolutionary algorithms at their steady state
2015,
Assessing the reliability of termination conditions for evolutionary algorithms (EAs)...
Papers per page: