Journal: Computational Optimization and Applications

Found 579 papers in total
On the rate of local convergence of high-order-infeasible-path-following algorithms for P*-linear complementarity problems
On the rate of local convergence of high-order-infeasible-path-following algorithms for P*-linear complementarity problems
1999,
A simple and unified analysis is provided on the rate of local convergence for a class...
Primal–dual path-following algorithms for determinant maximization problems with linear matrix inequalities
Primal–dual path-following algorithms for determinant maximization problems with linear matrix inequalities
1999,
Primal–dual path-following algorithms are considered for determinant...
A note on error bounds for convex and nonconvex programs
A note on error bounds for convex and nonconvex programs
1999,
Given a single feasible solution x F and a single infeasible solution x l of a...
A controlled random search technique incorporating the simulated annealing concept for solving integer and mixed integer global optimization problems
A controlled random search technique incorporating the simulated annealing concept for solving integer and mixed integer global optimization problems
1999,
In this paper, a computational algorithm, named RST2ANU algorithm, has been developed...
An arbitrary starting variable dimension algorithm for computing an integer point of a simplex
An arbitrary starting variable dimension algorithm for computing an integer point of a simplex
1999,
An arbitrary starting variable dimension algorithm is proposed to compute an integer...
Convergence and error bound for perturbation of linear programs
Convergence and error bound for perturbation of linear programs
1999,
In various penalty/smoothing approaches to solving a linear program, one regularizes...
Warm start and ϵ-subgradients in a cutting plane scheme for black-angular linear programs
Warm start and ϵ-subgradients in a cutting plane scheme for black-angular linear programs
1999,
This paper addresses the issues involved with an interior point-based decomposition...
Stabilization of interior-point methods for linear programming
Stabilization of interior-point methods for linear programming
1999,
The paper studies numerical stability problems arising in the application of...
A deterministic approach to linear programs with several additional multiplicative constraints
A deterministic approach to linear programs with several additional multiplicative constraints
1999,
We consider a global optimization problem of minimizing a linear function subject to p...
Solving Euclidean distance matrix completion problems via semidefinite programming
Solving Euclidean distance matrix completion problems via semidefinite programming
1999,
Given a partial symmetric matrix A with only certain elements specified, the Euclidean...
QPECgen, a MATLAB generator for mathematical programs with quadratic objectives and affine variational inequality constraints
QPECgen, a MATLAB generator for mathematical programs with quadratic objectives and affine variational inequality constraints
1999,
We describe a technique for generating a special class, called QPEC, of mathematical...
Computational study of the relationships between feasible and efficient sets and an approximation
Computational study of the relationships between feasible and efficient sets and an approximation
1999,
The computational difficulty of obtaining the efficient set in multi-objective...
An interior-point algorithm for nonconvex nonlinear programming
An interior-point algorithm for nonconvex nonlinear programming
1999,
The paper describes an interior-point algorithm for nonconvex nonlinear programming...
Testing parallel variable transformation
Testing parallel variable transformation
1999,
This paper studies performance of the parallel variable transformation (PVT) algorithm...
A modified barrier–augmented Lagrangian method for constrained minimization
A modified barrier–augmented Lagrangian method for constrained minimization
1999,
We present and analyze an interior–exterior augmented Lagrangian method for...
Multicategory classification by support vector machines
Multicategory classification by support vector machines
1999,
We examine the problem of how to discriminate between objects of three or more...
Stabilized sequential quadratic programming
Stabilized sequential quadratic programming
1999,
Recently, Wright proposed a stabilized sequential quadratic programming algorithm for...
Augmented Lagrangians with adaptive precision control for quadratic programming with equality constraints
Augmented Lagrangians with adaptive precision control for quadratic programming with equality constraints
1999,
In this paper we introduce an augmented Lagrangian type algorithm for strictly convex...
A complete efficiency ranking of decision making units in data envelopment analysis
A complete efficiency ranking of decision making units in data envelopment analysis
1999,
The efficiency measures provided by DEA can be used for ranking Decision Making Units...
Solving Euclidean distance multifacility location problems using conjugate subgradient and line-search methods
Solving Euclidean distance multifacility location problems using conjugate subgradient and line-search methods
1999,
Subgradient methods are popular for solving nondifferentiable optimization problems...
Optimal control of continuous casting by nondifferentiable multiobjective optimization
Optimal control of continuous casting by nondifferentiable multiobjective optimization
1998,
A new version of an interactive NIMBUS method for nondifferentiable multiobjective...
Incremental gradient algorithms with stepsizes bounded away from zero
Incremental gradient algorithms with stepsizes bounded away from zero
1998,
We consider the class of incremental gradient methods for minimizing a sum of...
The adjoint Newton algorithm for large-scale unconstrained optimization in meteorology applications
The adjoint Newton algorithm for large-scale unconstrained optimization in meteorology applications
1998,
A new algorithm is presented for carrying out large-scale unconstrained optimization...
A new class of semismooth Newton-type methods for nonlinear complementarity problems
A new class of semismooth Newton-type methods for nonlinear complementarity problems
1998,
We introduce a new, one-parametric class of NCP-functions. This class subsumes the...
Papers per page: