Inverse optimization for linearly constrained convex separable programming problems

Jianzhong Zhang; Chengxian Xu

doi:10.1016/j.ejor.2009.01.043

ScienceGate Book Chapters

JOURNAL ARTICLE

Inverse optimization for linearly constrained convex separable programming problems

Jianzhong Zhang Chengxian Xu

Year: 2009 Journal: European Journal of Operational Research Vol: 200 (3)Pages: 671-679 Publisher: Elsevier BV

DOI: 10.1016/j.ejor.2009.01.043

Get Full-Text PDF Get Analytical Report

Keywords:

Mathematical optimization Separable space Mathematics Convex optimization Inverse Norm (philosophy) Quadratic programming Linear programming Regular polygon Conic optimization Convex analysis Quadratically constrained quadratic program Inverse problem Quadratic equation Optimization problem Mathematical analysis

Metrics

Cited By

2.30

FWCI (Field Weighted Citation Impact)

Refs

0.88

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Advanced Optimization Algorithms Research

Physical Sciences → Mathematics → Numerical Analysis

Optimization and Variational Analysis

Physical Sciences → Computer Science → Computational Theory and Mathematics

Optimization and Mathematical Programming

Physical Sciences → Engineering → Control and Systems Engineering

Inverse optimization for linearly constrained convex separable programming problems

Metrics

Citation History

Topics

Related Documents

Dual gradient method for linearly constrained, strongly convex, separable mathematical programming problems

An alternating direction-based contraction method for linearly constrained separable convex programming problems

Inertial Proximal ADMM for Linearly Constrained Separable Convex Optimization

Refined proximity and sensitivity results in linearly constrained convex separable integer programming

Numerical solution of box constrained separable convex quadratic programming problems