Journal: Mathematical Programming

Found 797 papers in total
An exact duality theory for semidefinite programming and its complexity implications
An exact duality theory for semidefinite programming and its complexity implications
1997,
In this paper, an exact dual is derived for Semidefinite Programming (SDP), for which...
The Projective Method for solving linear matrix inequalities
The Projective Method for solving linear matrix inequalities
1997,
Numerous problems in control and systems theory can be formulated in terms of linear...
Connections between semidefinite relaxations of the max-cut and stable set problems
Connections between semidefinite relaxations of the max-cut and stable set problems
1997,
We describe links between a recently introduced semidefinite relaxation for the...
A cone programming approach to the bilinear matrix inequality problem and its geometry
A cone programming approach to the bilinear matrix inequality problem and its geometry
1997,
We discuss an approach for solving the Bilinear Matrix Inequality (BMI) based on its...
A semidefinite framework for trust region subproblems with applications to large scale minimization
A semidefinite framework for trust region subproblems with applications to large scale minimization
1997,
Primal–dual pairs of semidefinite programs provide a general framework for the...
First and second order analysis of nonlinear semidefinite programs
First and second order analysis of nonlinear semidefinite programs
1997,
In this paper we study nonlinear semidefinite programming problems. Convexity, duality...
The long-step method of analytic centers for fractional problems
The long-step method of analytic centers for fractional problems
1997,
We develop a long-step surface-following version of the method of analytic centers for...
Constraint aggregation principle in convex optimization
Constraint aggregation principle in convex optimization
1997,
A general constraint aggregation technique is proposed for convex optimization...
Separating plane algorithms for convex optimization
Separating plane algorithms for convex optimization
1997,
The equivalent formulation of a convex optimization problem is the computation of a...
Variable metric bundle methods: From conceptual to implementable forms
Variable metric bundle methods: From conceptual to implementable forms
1997,
To minimize a convex function, we combine Moreau–Yosida regularizations,...
A preconditioning proximal Newton method for nondifferentiable convex optimization
A preconditioning proximal Newton method for nondifferentiable convex optimization
1997,
We propose a proximal Newton method for solving nondifferentiable convex optimization....
A trust region method for minimization of nonsmooth functions with linear constraints
A trust region method for minimization of nonsmooth functions with linear constraints
1997,
We introduce a trust region algorithm for minimization of nonsmooth functions with...
Modified Newton methods for solving a semismooth reformulation of monotone complementarity problems
Modified Newton methods for solving a semismooth reformulation of monotone complementarity problems
1997,
In this paper, we propose a Newton-type method for solving a semismooth reformulation...
A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems
A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems
1997,
A new algorithm for the solution of large-scale nonlinear complementarity problems is...
Solution of monotone complementarity problems with locally Lipschitzian functions
Solution of monotone complementarity problems with locally Lipschitzian functions
1997,
The paper deals with complementarity problems CP( F ), where the underlying function F...
Implementation of a continuation method for normal maps
Implementation of a continuation method for normal maps
1997,
This paper presents an implementation of a nonsmooth continuation method of which the...
Parametrizations of Kojima's system and relations to penalty and barrier functions
Parametrizations of Kojima's system and relations to penalty and barrier functions
1997,
We investigate two homotopies that perturb Kojima's system for describing critical...
Sensitivity analysis of composite piecewise smooth equations
Sensitivity analysis of composite piecewise smooth equations
1997,
This paper is a contribution to the sensitivity analysis of piecewise smooth...
On piecewise quadratic Newton and trust region problems
On piecewise quadratic Newton and trust region problems
1997,
Some recent algorithms for nonsmooth optimization require solutions to certain...
Duality theorem for a generalized Fermat–Weber problem
Duality theorem for a generalized Fermat–Weber problem
1997,
The classical Fermat–Weber problem is to minimize the sum of the distances from...
Complexity of some cutting plane methods that use analytic centers
Complexity of some cutting plane methods that use analytic centers
1996,
We consider cutting plane methods for minimizing a convex (possibly nondifferentiable)...
The generalized linear complementarity problem revisited
The generalized linear complementarity problem revisited
1996,
Given a vertical block matrix A , we consider in this paper the generalized linear...
Nonlinear rescaling and proximal-like methods in convex optimization
Nonlinear rescaling and proximal-like methods in convex optimization
1997,
The nonlinear rescaling principle (NRP) consists of transforming the objective...
A capacity scaling algorithm for convex cost submodular flows
A capacity scaling algorithm for convex cost submodular flows
1997,
This paper presents a scaling scheme for submodular functions. A small but strictly...
Papers per page: