Journal: Mathematical Programming (Series A)

Found 506 papers in total
Quantitative stability of variational systems: III. ℝà-approximate solutions
Quantitative stability of variational systems: III. ℝà-approximate solutions
1993,
The authors prove that the •- optimal solutions of convex optimization problems...
Characterization of perturbed mathematical programs and interval analysis
Characterization of perturbed mathematical programs and interval analysis
1993,
Several authors have used interval arithmetic to deal with parametric or sensitivity...
A simple constraint qualification in convex programming
A simple constraint qualification in convex programming
1993,
The authors introduce and characterize a class of differentiable convex functions for...
A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio
A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio
1993,
The authors extend Clarkson's randomized algorithm for linear programming to a general...
Concave extensions for nonlinear 0-1 maximization problems
Concave extensions for nonlinear 0-1 maximization problems
1993,
A well-known linearization technique for nonlinear 0-1 maximization problems can be...
A primal-dual infeasible-interior-point algorithm for linear programming
A primal-dual infeasible-interior-point algorithm for linear programming
1993,
As in many primal-dual interior-point algorithms, a primal-dual...
Finding all maximal efficient faces in multiobjective linear programming
Finding all maximal efficient faces in multiobjective linear programming
1993,
An algorithm for finding the whole efficient set of a multiobjective linear program is...
Analysis of a self-scaling quasi-Newton method
Analysis of a self-scaling quasi-Newton method
1993,
The authors study the self-scaling BFGS method of Oren and Luenberger for solving...
Constraint classification in mathematical programming
Constraint classification in mathematical programming
1993,
Consider a set of algebraic inequality constraints defining either an empty or a...
An algorithm for solving convex programs with an additional convex-concave constraint
An algorithm for solving convex programs with an additional convex-concave constraint
1993,
An implementable decomposition method based on branch-and-bound techniques is proposed...
Minimization of a quasi-convex function over a efficient set
Minimization of a quasi-convex function over a efficient set
1993,
The nonconvex programming problem of minimizing a quasi-concave function over an...
Linear complementarity problems and multiple objective programming
Linear complementarity problems and multiple objective programming
1993,
An equivalence is demonstrated between solving a linear complementarity problem with...
Polyhedral study of the capacitated vehicle routing problem
Polyhedral study of the capacitated vehicle routing problem
1993,
The capacitated vehicle routing problem (CVRP) considered in this paper occurs when...
Polynomial dual network simplex algorithms
Polynomial dual network simplex algorithms
1993,
The authors show how to use polynomial and strongly polynomial capacity scaling...
A deterministic algorithm for global optimization
A deterministic algorithm for global optimization
1993,
The authors present an algorithm for finding the global maximum of a multimodal,...
A nonsmooth version of Newton’s method
A nonsmooth version of Newton’s method
1993,
Newton’s method for solving a nonlinear equation of several variables is...
A globally convergent Newton method for solving strongly monotone variational inequalities
A globally convergent Newton method for solving strongly monotone variational inequalities
1993,
Variational inequality problems have been used to formulate and study equilibrium...
D.c. sets, d.c. functions and nonlinear equations
D.c. sets, d.c. functions and nonlinear equations
1993,
A d.c. set is a set which is the difference of two convex sets. The paper shows that...
On combining feasibility, descent and superlinear convergence in inequality constrained optimization
On combining feasibility, descent and superlinear convergence in inequality constrained optimization
1993,
Extension of quasi-Newton techniques from unconstrained to constrained optimization...
Lower subdifferentiability of quadratic forms
Lower subdifferentiability of quadratic forms
1993,
In this paper the authors characterize those quadratic functions whose restrictions to...
Updating of conjugate direction matrices using members of Broyden’s family
Updating of conjugate direction matrices using members of Broyden’s family
1993,
Many iterative algorithms for optimization calculations use a second derivative...
A smooth method for the finite minimax problem
A smooth method for the finite minimax problem
1993,
The authors consider unconstrained minimax problems where the objective function is...
NE/SQP: A robust algorithm for the nonlinear complementarity problem
NE/SQP: A robust algorithm for the nonlinear complementarity problem
1993,
In this paper, the authors present a new iterative method for solving the nonlinear
Constraint qualifications in quasidifferentiable optimization
Constraint qualifications in quasidifferentiable optimization
1993,
The classical linearization procedure for differentiable nonlinear programming...
Papers per page: